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-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:35:42,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:35:42,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:35:42,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:35:42,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:35:42,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:35:42,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:35:42,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:35:42,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:35:42,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:35:42,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:35:42,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:35:42,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:35:42,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:35:42,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:35:42,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:35:42,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:35:42,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:35:42,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:35:42,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:35:42,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:35:42,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:35:42,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:35:42,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:35:42,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:35:42,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:35:42,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:35:42,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:35:42,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:35:42,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:35:42,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:35:42,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:35:42,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:35:42,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:35:42,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:35:42,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:35:42,083 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-01-31 17:35:42,106 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:35:42,107 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:35:42,107 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:35:42,108 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:35:42,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:35:42,109 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:35:42,109 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:35:42,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:35:42,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:35:42,110 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:35:42,110 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:35:42,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:35:42,110 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:35:42,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:35:42,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:35:42,111 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:35:42,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:35:42,112 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:35:42,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:35:42,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:35:42,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:35:42,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:35:42,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:35:42,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:35:42,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:35:42,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:35:42,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:35:42,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:35:42,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:35:42,115 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:35:42,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:35:42,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:35:42,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:35:42,116 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:35:42,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:35:42,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:35:42,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:35:42,168 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:35:42,169 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:35:42,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-31 17:35:42,170 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-31 17:35:42,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:35:42,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:35:42,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:35:42,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:35:42,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:35:42,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:35:42,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:35:42,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:35:42,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:35:42,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/1) ... [2019-01-31 17:35:42,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:35:42,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:35:42,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:35:42,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:35:42,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:35:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:35:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:35:42,738 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:35:42,738 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-31 17:35:42,739 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:35:42 BoogieIcfgContainer [2019-01-31 17:35:42,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:35:42,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:35:42,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:35:42,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:35:42,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:35:42" (1/2) ... [2019-01-31 17:35:42,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64675aeb and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:35:42, skipping insertion in model container [2019-01-31 17:35:42,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:35:42" (2/2) ... [2019-01-31 17:35:42,756 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-31 17:35:42,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:35:42,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-31 17:35:42,795 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-31 17:35:42,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:35:42,834 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:35:42,834 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:35:42,834 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:35:42,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:35:42,835 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:35:42,835 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:35:42,835 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:35:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-31 17:35:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:35:42,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:42,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:35:42,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-31 17:35:42,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:42,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:42,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:42,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:42,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:43,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:35:43,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:35:43,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:43,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:35:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:35:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:35:43,097 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-31 17:35:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:43,302 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-31 17:35:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:43,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:35:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:43,322 INFO L225 Difference]: With dead ends: 29 [2019-01-31 17:35:43,323 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:35:43,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:35:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:35:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-31 17:35:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:35:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-31 17:35:43,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-31 17:35:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:43,365 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-31 17:35:43,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:35:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-31 17:35:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:43,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:43,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:43,367 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-31 17:35:43,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:43,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:43,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:43,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:43,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:43,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:43,511 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-31 17:35:43,590 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:43,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:44,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:44,717 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-01-31 17:35:44,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:44,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:44,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:44,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:44,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:44,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:44,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:44,999 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:35:45,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:35:45,322 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-31 17:35:45,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:35:45,537 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-31 17:35:45,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:35:45,771 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-31 17:35:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:45,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:35:45,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:45,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:46,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:46,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:46,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:46,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:46,223 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-01-31 17:35:46,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:35:46,226 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,426 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,575 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,588 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:46,641 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:35:46,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:46,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:35:46,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:46,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:46,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:46,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:46,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:46,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:35:46,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:46,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:35:46,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:35:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:46,853 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-31 17:35:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:47,269 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-31 17:35:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:35:47,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:35:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:47,271 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:35:47,271 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:35:47,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:35:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:35:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-31 17:35:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:35:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-31 17:35:47,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-31 17:35:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:47,279 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-31 17:35:47,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:35:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-31 17:35:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:47,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:47,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:47,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-31 17:35:47,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:47,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:47,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:47,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:47,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:47,396 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-31 17:35:47,403 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:47,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:47,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:47,891 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-01-31 17:35:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:47,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:47,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:47,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:47,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:47,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:48,090 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:35:48,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:48,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:48,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:48,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:48,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:48,423 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-31 17:35:48,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:35:48,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:48,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:48,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:35:49,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:35:49,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:35:49,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,316 INFO L303 Elim1Store]: Index analysis took 159 ms [2019-01-31 17:35:49,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:35:49,318 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,395 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,412 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,429 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:49,465 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-31 17:35:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:49,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:35:49,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:49,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:49,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:49,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:49,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:35:49,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:35:49,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:49,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:35:49,601 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-31 17:35:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:49,670 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-31 17:35:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:35:49,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:35:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:49,671 INFO L225 Difference]: With dead ends: 23 [2019-01-31 17:35:49,671 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 17:35:49,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:35:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 17:35:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-31 17:35:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:35:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-31 17:35:49,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-31 17:35:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:49,677 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-31 17:35:49,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-31 17:35:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:49,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:49,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:49,679 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-31 17:35:49,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:49,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:49,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:49,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:49,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:49,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:49,764 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-31 17:35:49,766 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:49,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:52,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:52,900 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 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-01-31 17:35:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:52,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:52,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:52,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:52,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:52,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:52,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:53,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:35:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:35:53,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:35:53,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:35:53,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:35:53,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:53,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:53,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:53,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:53,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:53,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:35:53,510 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,565 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,586 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,688 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:53,759 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-31 17:35:53,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:53,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:35:53,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:53,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:53,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-31 17:35:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:53,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:53,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:35:53,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:35:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:35:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:53,884 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-31 17:35:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:54,082 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-31 17:35:54,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:35:54,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:35:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:54,083 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:35:54,083 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:35:54,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:35:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-31 17:35:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:35:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-31 17:35:54,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-31 17:35:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:54,091 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-31 17:35:54,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:35:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-31 17:35:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:54,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:54,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:54,093 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-31 17:35:54,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:54,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:54,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:54,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:54,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:54,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:54,144 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-31 17:35:54,146 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:54,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:54,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:54,447 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-01-31 17:35:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:54,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:54,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:54,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:54,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:54,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:54,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:54,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:54,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:54,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:54,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:35:54,650 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:35:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:35:54,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:35:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:54,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:35:54,930 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,945 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:54,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:55,009 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:35:55,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:35:55,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:55,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:55,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:55,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:55,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:35:55,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:55,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:35:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:35:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:35:55,123 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-31 17:35:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:55,295 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-31 17:35:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:35:55,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:35:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:55,297 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:35:55,297 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:35:55,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:35:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:35:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-31 17:35:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:35:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-31 17:35:55,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-31 17:35:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:55,304 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-31 17:35:55,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:35:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-31 17:35:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:55,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:55,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:55,306 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:55,306 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-31 17:35:55,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:55,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:55,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:55,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:55,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:55,406 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-31 17:35:55,407 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:55,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:55,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:55,772 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-01-31 17:35:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:55,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:55,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:55,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:55,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:55,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:55,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:55,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:55,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:55,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:55,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:55,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:55,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:55,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:35:55,959 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:55,988 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:35:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:35:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:35:56,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:35:56,207 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,223 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,237 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:56,287 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:35:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:35:56,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:56,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:35:56,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:56,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:35:56,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:56,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:56,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:35:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:56,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:56,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:56,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:56,572 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-31 17:35:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:57,159 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-31 17:35:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:57,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:57,161 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:35:57,162 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:35:57,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:35:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-31 17:35:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:35:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-31 17:35:57,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-31 17:35:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:57,171 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-31 17:35:57,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-31 17:35:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:57,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:57,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:57,172 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-31 17:35:57,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:57,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:57,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:57,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:57,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:57,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:57,257 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-31 17:35:57,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:57,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:57,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:57,616 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-01-31 17:35:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:57,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:57,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:57,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:57,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:57,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:57,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:57,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:35:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:35:57,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:35:57,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:35:57,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:57,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:35:57,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:57,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:58,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:58,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:58,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:58,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:58,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:35:58,088 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,124 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,145 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,173 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:58,238 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:35:58,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:35:58,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:58,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:35:58,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:58,421 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:58,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-31 17:35:58,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:58,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:58,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:35:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:58,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:58,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-01-31 17:35:58,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:58,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:58,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:58,534 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-31 17:35:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:58,992 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-31 17:35:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:58,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:35:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:58,994 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:35:58,995 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:35:58,995 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-01-31 17:35:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:35:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-31 17:35:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:35:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-31 17:35:59,005 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-31 17:35:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:59,006 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-31 17:35:59,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-31 17:35:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:59,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:59,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:59,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-31 17:35:59,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:59,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:59,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:59,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:59,123 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:59,124 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-31 17:35:59,125 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:59,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:59,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:59,452 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-01-31 17:35:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:59,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:59,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:59,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:59,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:59,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:59,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:59,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:35:59,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:35:59,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:59,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:35:59,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:35:59,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:35:59,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:35:59,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:35:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:35:59,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:35:59,836 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,851 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:59,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:59,917 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:35:59,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:59,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:35:59,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:00,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:00,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:00,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:00,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:00,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:00,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:00,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:00,032 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:00,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:36:00,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:00,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:00,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-31 17:36:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:00,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:00,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:00,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:00,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:00,171 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-31 17:36:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:00,567 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-31 17:36:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:00,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:00,568 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:36:00,568 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:36:00,569 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-01-31 17:36:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:36:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-31 17:36:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:36:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-31 17:36:00,578 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-31 17:36:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:00,578 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-31 17:36:00,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-31 17:36:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:00,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:00,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:00,579 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-31 17:36:00,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:00,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:00,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:00,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:00,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:00,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:00,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:00,660 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-31 17:36:00,661 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:00,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:00,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:00,963 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-01-31 17:36:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:00,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:00,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:00,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:00,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:00,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:01,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:01,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:01,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:01,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:01,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:01,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:01,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:01,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:01,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:01,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:01,337 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,715 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,817 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,832 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:01,889 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:01,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:01,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:36:01,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:01,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:01,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:02,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:02,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:36:02,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:02,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:02,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:02,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:02,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:02,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:02,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:02,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:02,116 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-31 17:36:02,296 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-31 17:36:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:02,700 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-31 17:36:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:02,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:02,702 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:36:02,702 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:36:02,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:36:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-31 17:36:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:36:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-31 17:36:02,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-31 17:36:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:02,712 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-31 17:36:02,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-31 17:36:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:02,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:02,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:02,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-31 17:36:02,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:02,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:02,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:02,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:02,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:02,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:02,804 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-31 17:36:02,805 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:02,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:03,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:03,087 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-01-31 17:36:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:03,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:03,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:03,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:03,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:03,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:03,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:03,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:03,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:03,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:03,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:03,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:03,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:03,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:03,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:03,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:03,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:03,426 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,502 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:03,548 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:03,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:03,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:03,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:03,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:03,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:36:03,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:03,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:03,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:36:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:03,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:36:03,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:03,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:03,750 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-31 17:36:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:04,182 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-31 17:36:04,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:04,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:04,183 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:36:04,183 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:36:04,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:36:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-31 17:36:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:36:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-31 17:36:04,195 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-31 17:36:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:04,195 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-31 17:36:04,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-31 17:36:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:04,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:04,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:04,196 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-31 17:36:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:04,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:04,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:04,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:04,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:04,299 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-31 17:36:04,300 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:04,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:04,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:04,504 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-01-31 17:36:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:04,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:04,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:04,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:04,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:04,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:04,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:04,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:04,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:04,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:04,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:04,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:04,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:04,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:04,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:04,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:04,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:04,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:04,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:05,004 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:05,021 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:05,037 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:05,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:05,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:05,086 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:05,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:05,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:05,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:05,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:05,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:05,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:05,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:36:05,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:05,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:36:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:36:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:36:05,247 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-31 17:36:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:05,482 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-31 17:36:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:36:05,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:36:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:05,484 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:36:05,485 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:36:05,485 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-01-31 17:36:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:36:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-31 17:36:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:36:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-31 17:36:05,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-31 17:36:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:05,496 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-31 17:36:05,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:36:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-31 17:36:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:05,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:05,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:05,497 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-31 17:36:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:05,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:05,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:05,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:05,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:05,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:05,619 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:05,619 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-31 17:36:05,620 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:05,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:05,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:05,888 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-01-31 17:36:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:05,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:05,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:05,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:05,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:05,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:05,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:05,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:05,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:05,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:06,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:06,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:06,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:06,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:06,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:06,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:06,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:06,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:06,559 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,601 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,622 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:06,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:06,710 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:06,960 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-31 17:36:06,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:06,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:36:06,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:07,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:07,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:07,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:07,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:36:07,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:07,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:07,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-31 17:36:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:07,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:07,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:07,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:36:07,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:07,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:07,355 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-31 17:36:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:07,843 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-31 17:36:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:07,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:07,845 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:36:07,846 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:36:07,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:36:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-31 17:36:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:36:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-31 17:36:07,859 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-31 17:36:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:07,859 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-31 17:36:07,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-31 17:36:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:07,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:07,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:07,861 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-31 17:36:07,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:07,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:07,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:07,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:07,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:07,968 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-31 17:36:07,969 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:07,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:08,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:08,201 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-01-31 17:36:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:08,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:08,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:08,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:08,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:08,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:08,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:08,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:08,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:08,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:08,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:08,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:08,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:08,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:08,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:08,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:08,571 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,588 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:08,649 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:08,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:08,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:08,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:08,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:08,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:36:08,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:08,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:08,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-31 17:36:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:08,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:08,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:08,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:08,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:08,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:08,850 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-31 17:36:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:09,321 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-31 17:36:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:09,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:09,323 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:36:09,323 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:36:09,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:36:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-31 17:36:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:36:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-31 17:36:09,338 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-31 17:36:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:09,338 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-31 17:36:09,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-31 17:36:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:09,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:09,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:09,340 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-31 17:36:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:09,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:09,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:09,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:09,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:09,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:09,434 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-31 17:36:09,436 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:09,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:10,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:10,008 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:36:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:10,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:10,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:10,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:10,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:10,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:10,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:10,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:10,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:10,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:10,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:10,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:10,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:10,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:10,495 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,521 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,547 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,573 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,600 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:10,647 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:36:10,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:10,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:10,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:10,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:10,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-31 17:36:10,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:10,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:10,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:36:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:10,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:10,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:10,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:10,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:10,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:10,939 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-31 17:36:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:11,856 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-31 17:36:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:11,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:11,861 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:36:11,861 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:36:11,862 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-01-31 17:36:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:36:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-31 17:36:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:36:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-31 17:36:11,882 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-31 17:36:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:11,882 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-31 17:36:11,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-31 17:36:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:11,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:11,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:11,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-31 17:36:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:11,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:12,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:12,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:12,027 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:12,027 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-31 17:36:12,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:12,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:12,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:12,260 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-01-31 17:36:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:12,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:12,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:12,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:12,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:12,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:12,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:12,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:12,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:36:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:36:12,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:36:12,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:36:12,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:36:12,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,375 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:36:12,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:36:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:36:12,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:36:12,569 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,582 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:12,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:12,644 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-31 17:36:12,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:12,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:12,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:12,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:36:12,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-31 17:36:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:12,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:36:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:36:12,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:36:12,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:36:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:36:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:36:12,839 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-31 17:36:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:12,939 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-31 17:36:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:36:12,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:36:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:12,941 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:36:12,942 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:36:12,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:36:12,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:36:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-31 17:36:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 17:36:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-31 17:36:12,960 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-31 17:36:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:12,960 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-31 17:36:12,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:36:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-31 17:36:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:12,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:12,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:12,962 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:12,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-31 17:36:12,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:12,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:12,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:12,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:12,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:13,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:13,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:13,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:13,049 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-31 17:36:13,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:13,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:13,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:13,297 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-01-31 17:36:13,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:13,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:13,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:13,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:13,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:13,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:13,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:13,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:13,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:13,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:13,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:13,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:13,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:13,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:13,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:13,608 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,633 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,654 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,669 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:13,728 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:13,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:13,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:13,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:13,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:13,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:36:13,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:13,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:13,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:13,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:13,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:13,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:13,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:13,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:13,963 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-31 17:36:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:14,357 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-31 17:36:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:14,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:36:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:14,360 INFO L225 Difference]: With dead ends: 121 [2019-01-31 17:36:14,360 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:36:14,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:36:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-31 17:36:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:36:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-31 17:36:14,377 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-31 17:36:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:14,377 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-31 17:36:14,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-31 17:36:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:14,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:14,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:14,379 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-31 17:36:14,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:14,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:14,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:14,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:14,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:14,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:14,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:14,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:14,455 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-31 17:36:14,456 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:14,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:14,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:14,639 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-01-31 17:36:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:14,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:14,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:14,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:14,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:14,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:14,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:14,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:14,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:36:14,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:36:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:36:14,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:36:14,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:36:14,738 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,786 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:36:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:36:14,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:36:14,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:14,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:36:14,972 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:14,987 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,000 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:15,047 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:36:15,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:36:15,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:15,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-31 17:36:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:15,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:15,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:15,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:36:15,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:36:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:36:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:36:15,184 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-31 17:36:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:15,419 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-31 17:36:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:36:15,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:36:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:15,422 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:36:15,422 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:36:15,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:36:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:36:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-31 17:36:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:36:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-31 17:36:15,439 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-31 17:36:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:15,439 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-31 17:36:15,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:36:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-31 17:36:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:15,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:15,440 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:36:15,440 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-31 17:36:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:15,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:15,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:15,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:15,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:36:15,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:36:15,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:15,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:36:15,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:36:15,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:36:15,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:36:15,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:15,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:15,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:15,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:15,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:15,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:15,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:15,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:15,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:15,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:15,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:15,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:16,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:16,115 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,144 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:16,270 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:16,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:36:16,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:16,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-01-31 17:36:16,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:16,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-31 17:36:16,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:16,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:36:16,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:16,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:16,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-31 17:36:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:16,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:17,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:17,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:17,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:17,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:17,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:17,379 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-31 17:36:18,324 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-31 17:36:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:18,946 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-31 17:36:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:18,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:18,948 INFO L225 Difference]: With dead ends: 133 [2019-01-31 17:36:18,948 INFO L226 Difference]: Without dead ends: 128 [2019-01-31 17:36:18,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-31 17:36:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-31 17:36:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:36:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-31 17:36:18,966 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-31 17:36:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:18,966 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-31 17:36:18,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-31 17:36:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:18,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:18,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:18,968 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-31 17:36:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:18,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:18,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:36:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:18,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:19,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:19,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:19,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:19,190 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-31 17:36:19,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:19,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:19,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:19,503 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-01-31 17:36:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:19,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:19,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:19,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:19,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:19,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:19,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:19,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:19,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:19,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:19,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:19,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:19,590 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:19,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:19,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:19,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:19,841 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,856 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,872 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:19,920 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:19,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:19,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:36:19,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:19,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:19,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:20,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:20,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:36:20,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:20,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:20,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:20,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:20,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:20,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:20,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:20,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:20,152 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-31 17:36:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:20,488 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-31 17:36:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:20,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:36:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:20,491 INFO L225 Difference]: With dead ends: 125 [2019-01-31 17:36:20,491 INFO L226 Difference]: Without dead ends: 124 [2019-01-31 17:36:20,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-31 17:36:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-31 17:36:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:36:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-31 17:36:20,511 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-31 17:36:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:20,511 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-31 17:36:20,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-31 17:36:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:20,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:20,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:20,512 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-31 17:36:20,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:20,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:20,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:20,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:20,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:20,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:20,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:20,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:20,672 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-31 17:36:20,673 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:20,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:21,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:21,084 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-01-31 17:36:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:21,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:21,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:21,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:21,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:21,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:21,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:21,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:21,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:21,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:21,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:21,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:21,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:21,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:21,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:21,594 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,639 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,662 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,697 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:21,788 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:21,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:36:21,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:21,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-31 17:36:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:21,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:21,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:36:21,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:21,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:22,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:22,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:36:22,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:22,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:22,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:36:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:22,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:22,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:22,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:22,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:22,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:22,154 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-31 17:36:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:23,891 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-31 17:36:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:23,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:23,893 INFO L225 Difference]: With dead ends: 149 [2019-01-31 17:36:23,893 INFO L226 Difference]: Without dead ends: 145 [2019-01-31 17:36:23,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:36:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-31 17:36:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-31 17:36:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:36:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-31 17:36:23,913 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-31 17:36:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:23,913 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-31 17:36:23,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-31 17:36:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:23,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:23,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:23,914 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:23,914 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-31 17:36:23,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:23,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:23,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:24,073 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:36:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:24,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:24,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:24,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:24,167 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-31 17:36:24,169 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:24,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:24,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:24,630 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-01-31 17:36:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:24,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:24,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:24,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:24,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:24,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:24,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:24,770 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:36:24,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:24,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:24,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:24,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:24,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:24,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:24,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:24,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:24,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:25,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:25,069 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,084 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,100 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:25,148 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:25,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:36:25,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:25,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:25,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:36:25,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:25,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,339 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:25,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:36:25,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:25,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:25,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:36:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:25,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:25,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:25,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:25,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:25,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:25,453 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-31 17:36:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:25,991 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-31 17:36:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:25,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:25,994 INFO L225 Difference]: With dead ends: 138 [2019-01-31 17:36:25,994 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:36:25,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:36:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:36:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-31 17:36:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:36:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-31 17:36:26,013 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-31 17:36:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:26,014 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-31 17:36:26,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-31 17:36:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:26,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:26,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:26,015 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-31 17:36:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:26,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:26,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:26,123 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:26,123 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-31 17:36:26,125 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:26,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:26,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:26,497 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-01-31 17:36:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:26,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:26,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:26,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:26,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:26,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:26,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:26,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:26,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:26,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:26,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:26,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:26,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:26,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:26,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:26,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:26,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:26,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:26,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:27,000 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,050 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,087 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:27,158 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:27,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:36:27,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:27,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,257 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:27,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-31 17:36:27,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:27,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:36:27,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:27,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-31 17:36:27,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:27,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:27,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:36:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:27,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:27,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:27,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:27,447 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-31 17:36:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:28,031 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-31 17:36:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:28,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:28,036 INFO L225 Difference]: With dead ends: 152 [2019-01-31 17:36:28,036 INFO L226 Difference]: Without dead ends: 151 [2019-01-31 17:36:28,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:36:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-31 17:36:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-31 17:36:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:36:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-31 17:36:28,057 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-31 17:36:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:28,058 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-31 17:36:28,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-31 17:36:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:28,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:28,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:28,059 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:28,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:28,059 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-31 17:36:28,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:28,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:28,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:28,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:28,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:28,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:28,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:28,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:28,182 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-31 17:36:28,183 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:28,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:28,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:28,518 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-01-31 17:36:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:28,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:28,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:28,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:28,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:28,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:28,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:28,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:28,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:28,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:28,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:28,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:28,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:28,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:29,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:29,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:29,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:29,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:29,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:29,066 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,103 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,124 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,154 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,168 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:29,225 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:29,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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-01-31 17:36:29,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:29,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:29,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,337 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:29,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-31 17:36:29,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:29,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-31 17:36:29,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:29,420 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:29,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-31 17:36:29,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:29,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:29,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-31 17:36:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:31,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:31,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:31,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:31,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:31,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:31,070 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-31 17:36:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:31,813 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-31 17:36:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:31,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:31,816 INFO L225 Difference]: With dead ends: 141 [2019-01-31 17:36:31,816 INFO L226 Difference]: Without dead ends: 140 [2019-01-31 17:36:31,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:36:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-31 17:36:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-31 17:36:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:36:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-31 17:36:31,839 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-31 17:36:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:31,839 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-31 17:36:31,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-31 17:36:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:31,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:31,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:31,840 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-31 17:36:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:31,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:32,212 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-31 17:36:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:32,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:32,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:32,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:32,525 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-31 17:36:32,526 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:32,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:32,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:32,873 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-01-31 17:36:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:32,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:32,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:32,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:32,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:32,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:32,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:32,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:32,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:32,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:32,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:32,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:32,967 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:33,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:33,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:33,236 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,252 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,266 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,283 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:33,316 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:33,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:36:33,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:33,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:33,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:36:33,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:33,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-31 17:36:33,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:33,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-31 17:36:33,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:33,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:33,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:36:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:33,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:33,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:33,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:33,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:33,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:33,572 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-31 17:36:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:34,221 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-31 17:36:34,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:36:34,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:34,224 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:36:34,224 INFO L226 Difference]: Without dead ends: 162 [2019-01-31 17:36:34,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:36:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-31 17:36:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-31 17:36:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 17:36:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-31 17:36:34,249 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-31 17:36:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:34,249 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-31 17:36:34,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-31 17:36:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:34,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:34,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:34,250 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-31 17:36:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:34,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:34,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:34,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:34,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:34,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:34,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:34,318 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-31 17:36:34,319 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:34,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:34,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:34,672 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-01-31 17:36:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:34,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:34,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:34,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:34,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:34,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:34,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:34,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:34,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:34,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:34,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:34,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:35,022 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-31 17:36:35,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:35,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:35,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:35,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:35,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:35,192 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,224 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,245 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,261 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,275 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,287 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:35,347 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:36:35,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:35,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:36:35,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:35,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:36:35,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,575 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:35,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:35,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:36:35,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:35,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:35,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:36:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:35,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:35,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:35,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:35,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:35,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:35,707 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-31 17:36:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:36,421 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-31 17:36:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:36,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:36,423 INFO L225 Difference]: With dead ends: 163 [2019-01-31 17:36:36,423 INFO L226 Difference]: Without dead ends: 160 [2019-01-31 17:36:36,423 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-01-31 17:36:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-31 17:36:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-31 17:36:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-31 17:36:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-31 17:36:36,444 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-31 17:36:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:36,445 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-31 17:36:36,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-31 17:36:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:36,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:36,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:36,446 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:36,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-31 17:36:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:36,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:36,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:36,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:36,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:36,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:36,574 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-31 17:36:36,576 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:36,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:36,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:36,871 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-01-31 17:36:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:36,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:36,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:36,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:36,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:36,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:36,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:36,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:36,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:37,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:37,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:37,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:37,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:37,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:37,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:37,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:37,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:37,184 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,210 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,260 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:37,305 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:37,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:36:37,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:37,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:37,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:36:37,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:37,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:36:37,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:37,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:37,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:36:37,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:37,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:37,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:36:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:37,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:37,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:37,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:37,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:37,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:37,603 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-31 17:36:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:38,155 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-31 17:36:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:38,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:38,158 INFO L225 Difference]: With dead ends: 165 [2019-01-31 17:36:38,158 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:36:38,158 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-01-31 17:36:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:36:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-31 17:36:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-31 17:36:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-31 17:36:38,184 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-31 17:36:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:38,185 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-31 17:36:38,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-31 17:36:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:38,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:38,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:38,186 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-31 17:36:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:38,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:38,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:38,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:38,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:38,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:38,223 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-31 17:36:38,224 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:38,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:38,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:38,458 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-01-31 17:36:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:38,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:38,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:38,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:38,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:38,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:38,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:38,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:38,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:38,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:38,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:38,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:38,554 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:38,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:38,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:38,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:38,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:38,796 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,813 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,829 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:38,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:38,878 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:39,333 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-31 17:36:39,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:39,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:39,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:39,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:39,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:39,419 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:39,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:36:39,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:39,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:39,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:36:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:39,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:39,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:36:39,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:39,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:36:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:36:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:36:39,511 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-31 17:36:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:39,794 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-31 17:36:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:39,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 17:36:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:39,796 INFO L225 Difference]: With dead ends: 158 [2019-01-31 17:36:39,797 INFO L226 Difference]: Without dead ends: 156 [2019-01-31 17:36:39,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-31 17:36:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-31 17:36:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-31 17:36:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-31 17:36:39,820 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-31 17:36:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:39,820 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-31 17:36:39,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:36:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-31 17:36:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:39,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:39,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:39,821 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-31 17:36:39,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:39,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:39,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:39,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:39,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:39,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:36:39,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:36:39,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:39,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:39,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:36:39,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:36:39,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:36:39,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:36:39,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:40,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:40,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:40,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:40,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:40,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:40,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:40,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:40,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:40,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:40,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:40,405 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,442 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,478 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,504 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:40,551 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:40,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:36:40,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:40,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:40,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:36:40,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:40,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:36:40,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:40,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:40,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:36:40,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:40,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:40,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:36:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:40,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 17:36:40,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:36:40,861 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-31 17:36:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:41,573 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-31 17:36:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:36:41,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:41,577 INFO L225 Difference]: With dead ends: 241 [2019-01-31 17:36:41,577 INFO L226 Difference]: Without dead ends: 235 [2019-01-31 17:36:41,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:36:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-31 17:36:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-31 17:36:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-31 17:36:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-31 17:36:41,614 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-31 17:36:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:41,614 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-31 17:36:41,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-31 17:36:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:41,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:41,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:41,616 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-31 17:36:41,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:41,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:36:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:41,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:42,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:42,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:42,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:42,031 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-31 17:36:42,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:42,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:42,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:42,305 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-01-31 17:36:42,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:42,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:42,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:42,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:42,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:42,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:42,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:42,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:42,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:42,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:42,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:42,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:42,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:42,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:42,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:42,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:42,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:42,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:42,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,730 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,763 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:42,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:42,796 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:43,038 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:36:43,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:36:43,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:43,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:36:43,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-31 17:36:43,400 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-31 17:36:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,409 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:43,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-31 17:36:43,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:43,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:43,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-31 17:36:43,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-31 17:36:43,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-31 17:36:43,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-31 17:36:44,149 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-31 17:36:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:44,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:44,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:44,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:44,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:44,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:44,274 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-31 17:36:44,754 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-31 17:36:45,268 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-31 17:36:45,551 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-31 17:36:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:45,846 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-31 17:36:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:45,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:36:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:45,849 INFO L225 Difference]: With dead ends: 208 [2019-01-31 17:36:45,850 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:36:45,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:36:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-31 17:36:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-31 17:36:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-31 17:36:45,890 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-31 17:36:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:45,890 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-31 17:36:45,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-31 17:36:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:45,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:45,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:45,892 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-31 17:36:45,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:45,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:45,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:45,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:46,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:46,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:46,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:46,041 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-31 17:36:46,042 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:46,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:46,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:46,548 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-01-31 17:36:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:46,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:46,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:46,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:46,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:46,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:46,771 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:36:46,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:46,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:46,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:46,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:46,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:46,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:46,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:46,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:47,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:47,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:47,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:47,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:47,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:47,039 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,114 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,143 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:47,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:47,222 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:47,472 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:36:47,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:36:47,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:47,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-31 17:36:47,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-31 17:36:47,883 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-31 17:36:47,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:47,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-31 17:36:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:36:48,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-31 17:36:48,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:48,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-31 17:36:48,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-31 17:36:48,409 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-31 17:36:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:48,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-31 17:36:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:36:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:48,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-31 17:36:48,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:48,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:48,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-31 17:36:48,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:49,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-31 17:36:49,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-31 17:36:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:49,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:36:49,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:49,293 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-31 17:36:49,942 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-31 17:36:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:50,509 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-31 17:36:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:36:50,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:50,514 INFO L225 Difference]: With dead ends: 280 [2019-01-31 17:36:50,514 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 17:36:50,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:36:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 17:36:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-31 17:36:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-31 17:36:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-31 17:36:50,553 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-31 17:36:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:50,553 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-31 17:36:50,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-31 17:36:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:50,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:50,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:50,554 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-31 17:36:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:50,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:50,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:50,943 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-31 17:36:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:36:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:36:50,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:36:50,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:36:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:36:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:36:50,946 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-31 17:36:51,092 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-31 17:36:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:51,319 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-31 17:36:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:36:51,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:36:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:51,323 INFO L225 Difference]: With dead ends: 201 [2019-01-31 17:36:51,323 INFO L226 Difference]: Without dead ends: 198 [2019-01-31 17:36:51,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:36:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-31 17:36:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-31 17:36:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-31 17:36:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-31 17:36:51,364 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-31 17:36:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:51,365 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-31 17:36:51,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:36:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-31 17:36:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:51,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:51,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:51,366 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-31 17:36:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:51,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:36:51,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:51,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:51,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:51,559 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-31 17:36:51,563 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:51,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:51,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:51,775 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-01-31 17:36:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:51,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:51,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:51,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:51,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:51,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:51,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:51,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:36:51,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:51,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:36:51,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:51,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:52,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:52,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:52,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:52,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:52,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:52,078 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,103 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,123 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,176 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:52,211 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:36:52,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:36:52,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:52,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:36:52,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:52,313 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:52,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:36:52,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:52,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:52,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-31 17:36:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:52,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:52,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:52,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:52,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:52,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:52,419 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-31 17:36:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:52,762 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-31 17:36:52,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:52,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:36:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:52,765 INFO L225 Difference]: With dead ends: 208 [2019-01-31 17:36:52,765 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:36:52,765 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-01-31 17:36:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:36:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-31 17:36:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-31 17:36:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-31 17:36:52,811 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-31 17:36:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:52,812 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-31 17:36:52,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-31 17:36:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:52,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:52,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:52,813 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-31 17:36:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:52,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:52,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:53,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:53,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:53,025 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-31 17:36:53,025 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:53,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:53,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:53,335 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-01-31 17:36:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:53,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:53,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:53,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:53,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:53,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:53,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:53,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:36:53,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:36:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:36:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:36:53,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:53,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:36:53,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:36:53,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:36:53,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:36:53,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:36:53,664 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,688 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,708 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,733 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:53,775 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:36:53,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:36:53,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:53,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:36:53,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:53,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-31 17:36:53,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:53,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:53,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-31 17:36:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:53,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:53,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:53,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:36:53,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:53,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:36:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:36:53,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:36:53,967 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-31 17:36:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:54,276 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-31 17:36:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:36:54,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:36:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:54,279 INFO L225 Difference]: With dead ends: 210 [2019-01-31 17:36:54,279 INFO L226 Difference]: Without dead ends: 208 [2019-01-31 17:36:54,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:36:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-31 17:36:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-31 17:36:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-31 17:36:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-31 17:36:54,310 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-31 17:36:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:54,310 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-31 17:36:54,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:36:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-31 17:36:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:54,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:54,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:54,311 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-31 17:36:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:54,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:54,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:54,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:54,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:54,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:36:54,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:36:54,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:54,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:54,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:36:54,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:36:54,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:36:54,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:36:54,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:54,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:54,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:54,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:54,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:54,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:54,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:54,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:54,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:54,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:54,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:54,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:54,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:54,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:54,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:54,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:54,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:54,944 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,067 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,088 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,118 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:55,177 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:55,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:36:55,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:55,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:55,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:36:55,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:55,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:36:55,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:55,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:55,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-31 17:36:55,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:55,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:55,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:36:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:55,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:55,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:55,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:55,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:55,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:55,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:55,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:55,522 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-31 17:36:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:57,045 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-31 17:36:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:57,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:57,049 INFO L225 Difference]: With dead ends: 242 [2019-01-31 17:36:57,049 INFO L226 Difference]: Without dead ends: 240 [2019-01-31 17:36:57,050 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-01-31 17:36:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-31 17:36:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-31 17:36:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-31 17:36:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-31 17:36:57,082 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-31 17:36:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:57,083 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-31 17:36:57,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-31 17:36:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:57,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:57,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:57,084 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-31 17:36:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:57,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:36:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:57,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:57,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:57,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:57,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:57,151 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-31 17:36:57,152 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:57,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:57,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:57,471 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-01-31 17:36:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:57,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:57,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:57,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:57,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:57,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:57,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:57,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:57,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:57,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:57,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:57,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:36:57,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,624 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:36:57,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:36:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:36:57,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:36:57,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:57,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:36:57,957 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:57,984 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,010 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,037 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:58,111 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:36:58,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:36:58,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:58,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:36:58,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:36:58,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:58,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-31 17:36:58,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:58,352 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:36:58,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-31 17:36:58,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:58,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:36:58,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:36:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:58,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:36:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:58,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:36:58,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:36:58,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:36:58,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:36:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:36:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:36:58,496 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-31 17:36:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:59,117 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-31 17:36:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:36:59,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:36:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:59,121 INFO L225 Difference]: With dead ends: 249 [2019-01-31 17:36:59,121 INFO L226 Difference]: Without dead ends: 247 [2019-01-31 17:36:59,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:36:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-31 17:36:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-31 17:36:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-31 17:36:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-31 17:36:59,155 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-31 17:36:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:59,155 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-31 17:36:59,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:36:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-31 17:36:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:36:59,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:59,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:36:59,157 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-31 17:36:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:59,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:59,330 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-31 17:36:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:59,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:59,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:59,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:36:59,364 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-31 17:36:59,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:59,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:59,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:36:59,666 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-01-31 17:36:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:59,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:36:59,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:59,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:36:59,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:59,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:36:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:59,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:36:59,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:36:59,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:36:59,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:36:59,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:36:59,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:36:59,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:36:59,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:36:59,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:36:59,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:36:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:36:59,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:37:00,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:37:00,010 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,026 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,041 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:00,091 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:37:00,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:37:00,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:00,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:37:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:37:00,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:00,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:37:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:00,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:00,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:37:00,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:00,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:00,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:37:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:00,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:00,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:37:00,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:00,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:37:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:37:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:37:00,451 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-31 17:37:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:01,003 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-31 17:37:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:37:01,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:37:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:01,007 INFO L225 Difference]: With dead ends: 260 [2019-01-31 17:37:01,007 INFO L226 Difference]: Without dead ends: 258 [2019-01-31 17:37:01,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:37:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-31 17:37:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-31 17:37:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:37:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-31 17:37:01,041 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-31 17:37:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:01,041 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-31 17:37:01,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:37:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-31 17:37:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:01,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:01,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:01,042 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-31 17:37:01,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:01,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:01,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:01,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:01,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:01,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:01,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:01,241 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:01,241 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-31 17:37:01,242 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:01,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:01,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:01,461 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-01-31 17:37:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:01,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:01,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:01,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:01,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:01,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:01,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:01,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:01,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:37:01,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:37:01,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:37:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:37:01,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:37:01,542 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:37:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:37:01,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:37:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:37:01,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:01,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:37:01,868 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,891 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,915 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,940 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:01,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:02,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:02,013 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:37:02,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:37:02,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:02,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:02,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:37:02,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:02,115 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:02,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-01-31 17:37:02,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:02,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:02,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-31 17:37:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:02,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:02,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:37:02,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:02,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:02,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:02,222 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-31 17:37:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:02,582 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-31 17:37:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:37:02,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:37:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:02,586 INFO L225 Difference]: With dead ends: 244 [2019-01-31 17:37:02,586 INFO L226 Difference]: Without dead ends: 243 [2019-01-31 17:37:02,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:37:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-31 17:37:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-31 17:37:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-31 17:37:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-31 17:37:02,632 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-31 17:37:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:02,633 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-31 17:37:02,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-31 17:37:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:02,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:02,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:02,634 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-31 17:37:02,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:02,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:02,771 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:37:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:02,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:02,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:02,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:02,789 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-31 17:37:02,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:02,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:03,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:03,020 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-01-31 17:37:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:03,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:03,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:03,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:03,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:03,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:03,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:03,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:03,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:37:03,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:37:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:37:03,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:37:03,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:37:03,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:37:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:37:03,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:37:03,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:37:03,324 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,340 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:03,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:03,402 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:37:03,596 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-31 17:37:03,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:03,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:37:03,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-31 17:37:03,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-31 17:37:03,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:417 [2019-01-31 17:37:04,125 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 86 [2019-01-31 17:37:04,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 88 [2019-01-31 17:37:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-31 17:37:04,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:04,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:04,327 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:04,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 76 [2019-01-31 17:37:04,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:04,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-31 17:37:04,393 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:186, output treesize:126 [2019-01-31 17:37:04,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-01-31 17:37:04,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:37:04,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:04,541 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-31 17:37:04,945 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-31 17:37:15,372 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-31 17:37:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:35,958 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-31 17:37:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:37:35,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:37:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:35,962 INFO L225 Difference]: With dead ends: 273 [2019-01-31 17:37:35,962 INFO L226 Difference]: Without dead ends: 272 [2019-01-31 17:37:35,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=79, Invalid=129, Unknown=2, NotChecked=0, Total=210 [2019-01-31 17:37:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-31 17:37:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-31 17:37:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-31 17:37:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-31 17:37:35,998 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-31 17:37:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:35,999 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-31 17:37:35,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-31 17:37:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:35,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:35,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:36,000 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:36,000 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-31 17:37:36,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:36,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:36,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:36,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:36,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:36,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:36,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:37:36,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:37:36,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:36,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:36,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:37:36,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:37:36,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:37:36,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:37:36,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:36,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:36,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:37:36,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:37:36,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:37:36,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:37:36,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:37:36,195 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:37:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:37:36,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:37:36,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:37:36,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:37:36,574 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,598 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,622 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,648 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:36,719 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:37:36,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:37:36,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:36,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:37:36,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:36,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:36,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-31 17:37:36,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:36,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:36,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-31 17:37:46,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:46,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-31 17:37:46,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:46,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:46,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:37:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:46,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:47,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:47,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:37:47,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:47,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:37:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:37:47,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=94, Unknown=1, NotChecked=0, Total=156 [2019-01-31 17:37:47,032 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-31 17:37:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:47,805 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-31 17:37:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:37:47,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:37:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:47,809 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:37:47,810 INFO L226 Difference]: Without dead ends: 273 [2019-01-31 17:37:47,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=93, Invalid=146, Unknown=1, NotChecked=0, Total=240 [2019-01-31 17:37:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-31 17:37:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-31 17:37:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:37:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-31 17:37:47,853 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-31 17:37:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:47,853 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-31 17:37:47,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:37:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-31 17:37:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:47,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:47,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:47,855 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-31 17:37:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:47,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:37:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:47,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:47,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:47,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:47,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:47,960 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-31 17:37:47,960 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:47,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:49,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:49,330 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 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-01-31 17:37:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:49,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:49,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:49,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:49,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:49,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:49,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:49,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:37:49,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:37:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:37:49,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:37:49,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:37:49,559 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:49,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:37:49,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:37:49,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:37:49,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:37:49,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:37:49,713 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,747 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,767 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,782 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,794 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:49,851 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-31 17:37:49,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:49,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:37:49,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:49,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:49,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-31 17:37:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:49,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:37:49,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:37:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:37:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:37:49,968 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-31 17:37:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:50,176 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-31 17:37:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:37:50,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:37:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:50,179 INFO L225 Difference]: With dead ends: 242 [2019-01-31 17:37:50,179 INFO L226 Difference]: Without dead ends: 241 [2019-01-31 17:37:50,180 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-01-31 17:37:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-31 17:37:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-31 17:37:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:37:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-31 17:37:50,215 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-31 17:37:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:50,216 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-31 17:37:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:37:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-31 17:37:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:50,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:50,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:50,216 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-31 17:37:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:50,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:50,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:50,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:50,365 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:50,365 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-31 17:37:50,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:50,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:51,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:51,021 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:37:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:51,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:51,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:51,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:51,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:51,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:51,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:37:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:37:51,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:37:51,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:37:51,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:37:51,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:51,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:37:51,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:37:51,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:37:51,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:37:51,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:37:51,467 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,502 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,553 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,566 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:51,612 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:37:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:37:51,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:51,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:37:51,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:37:51,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:51,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:37:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:51,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:37:51,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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 128 [2019-01-31 17:37:51,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:51,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:51,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-31 17:37:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:51,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:51,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:37:51,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:51,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:37:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:37:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:37:51,955 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-31 17:37:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:52,605 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-31 17:37:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:37:52,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:37:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:52,609 INFO L225 Difference]: With dead ends: 276 [2019-01-31 17:37:52,609 INFO L226 Difference]: Without dead ends: 274 [2019-01-31 17:37:52,610 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-01-31 17:37:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-31 17:37:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-31 17:37:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-31 17:37:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-31 17:37:52,655 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-31 17:37:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:52,655 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-31 17:37:52,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:37:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-31 17:37:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:52,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:52,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:52,656 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-31 17:37:52,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:52,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:52,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:52,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:52,728 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-31 17:37:52,729 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:52,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:52,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:52,953 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-01-31 17:37:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:52,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:52,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:52,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:52,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:52,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:52,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:52,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:52,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:37:53,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:37:53,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:37:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:37:53,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:53,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:37:53,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:37:53,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:37:53,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:37:53,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:37:53,231 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,258 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,279 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,295 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:53,356 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:37:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:37:53,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:53,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:37:53,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:53,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:37:53,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:53,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-31 17:37:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:53,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:53,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:53,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:37:53,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:53,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:53,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:53,690 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-31 17:37:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:54,141 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-31 17:37:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:37:54,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:37:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:54,146 INFO L225 Difference]: With dead ends: 288 [2019-01-31 17:37:54,146 INFO L226 Difference]: Without dead ends: 287 [2019-01-31 17:37:54,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:37:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-31 17:37:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-31 17:37:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-31 17:37:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-31 17:37:54,202 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-31 17:37:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:54,202 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-31 17:37:54,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-31 17:37:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:37:54,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:54,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:37:54,203 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-31 17:37:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:54,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:54,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:54,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:54,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:37:54,417 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-31 17:37:54,418 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:54,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:54,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:54,634 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-01-31 17:37:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:54,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:54,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:54,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:54,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:54,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:54,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:54,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:37:54,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:37:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:37:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:37:54,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:37:54,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:37:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:37:54,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:37:54,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:54,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:37:54,941 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,957 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,971 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:54,988 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:55,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:55,019 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:37:55,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:37:55,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:37:55,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:37:55,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-31 17:37:55,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:55,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:37:55,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:55,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:55,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-31 17:37:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:55,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:55,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:55,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:37:55,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:55,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:37:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:37:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:37:55,257 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-31 17:37:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:55,655 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-31 17:37:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:37:55,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:37:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:55,660 INFO L225 Difference]: With dead ends: 319 [2019-01-31 17:37:55,660 INFO L226 Difference]: Without dead ends: 318 [2019-01-31 17:37:55,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-31 17:37:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-31 17:37:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-31 17:37:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-31 17:37:55,721 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-31 17:37:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:55,721 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-31 17:37:55,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:37:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-31 17:37:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:37:55,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:55,723 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:37:55,723 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-31 17:37:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:55,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:55,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:55,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:55,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:37:55,800 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-31 17:37:55,800 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:55,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:55,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:55,967 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-01-31 17:37:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:55,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:55,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:55,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:55,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:55,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:55,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:55,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:37:56,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:37:56,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:37:56,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:37:56,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:56,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:37:56,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:37:56,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:37:56,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:37:56,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:37:56,236 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,259 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:56,347 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:37:56,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:37:56,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:56,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:37:56,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:56,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-31 17:37:56,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:56,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:56,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-31 17:37:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:56,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:56,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:37:56,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:56,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:37:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:37:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:37:56,547 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-31 17:37:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:56,758 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-31 17:37:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:37:56,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 17:37:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:56,761 INFO L225 Difference]: With dead ends: 290 [2019-01-31 17:37:56,761 INFO L226 Difference]: Without dead ends: 289 [2019-01-31 17:37:56,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:37:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-31 17:37:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-31 17:37:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-31 17:37:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-31 17:37:56,811 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-31 17:37:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:56,812 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-31 17:37:56,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:37:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-31 17:37:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:37:56,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:56,813 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 17:37:56,813 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-31 17:37:56,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:56,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:56,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:57,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:57,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:57,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:37:57,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:37:57,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:57,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:37:57,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:37:57,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:37:57,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:37:57,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:57,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:37:57,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:37:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:37:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:37:57,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:37:57,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:37:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:37:57,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:37:57,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:37:57,351 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,366 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,382 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,399 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:57,433 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-31 17:37:57,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:37:57,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:57,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:37:57,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:37:57,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:57,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:37:57,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:37:57,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:57,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:37:57,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:57,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:37:57,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:37:57,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:37:57,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:37:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:57,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:37:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:37:57,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:37:57,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:37:57,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:37:57,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:37:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:37:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:37:57,774 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-31 17:37:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:37:58,345 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-31 17:37:58,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:37:58,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:37:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:37:58,351 INFO L225 Difference]: With dead ends: 423 [2019-01-31 17:37:58,351 INFO L226 Difference]: Without dead ends: 421 [2019-01-31 17:37:58,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:37:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-31 17:37:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-31 17:37:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-31 17:37:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-31 17:37:58,424 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-31 17:37:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:37:58,424 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-31 17:37:58,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:37:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-31 17:37:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:37:58,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:37:58,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:37:58,426 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:37:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-31 17:37:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:37:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:58,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:37:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:37:58,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:37:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:37:58,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:58,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:37:58,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:37:58,541 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-31 17:37:58,542 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:37:58,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:58,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:37:58,973 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-01-31 17:37:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:58,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:37:58,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:37:58,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:37:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:37:58,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:37:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:37:59,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:37:59,193 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-31 17:37:59,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:37:59,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:37:59,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:37:59,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:37:59,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,461 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-31 17:37:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:37:59,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:37:59,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:37:59,563 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:00,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:00,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:00,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:00,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:00,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:01,430 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-31 17:38:01,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:01,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:01,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:01,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:01,670 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,694 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,721 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:01,819 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:38:01,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:01,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:01,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:01,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:38:01,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:01,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:01,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:38:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:02,031 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:02,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-31 17:38:02,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:02,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:02,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-31 17:38:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:02,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:02,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:02,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:02,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:02,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:02,259 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-31 17:38:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:02,856 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-31 17:38:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:02,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:02,861 INFO L225 Difference]: With dead ends: 368 [2019-01-31 17:38:02,861 INFO L226 Difference]: Without dead ends: 366 [2019-01-31 17:38:02,861 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-01-31 17:38:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-31 17:38:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-31 17:38:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-31 17:38:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-31 17:38:02,925 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-31 17:38:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:02,926 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-31 17:38:02,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-31 17:38:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:02,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:02,927 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:38:02,927 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:02,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-31 17:38:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:02,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:02,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:02,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:02,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:02,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:02,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:38:02,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:38:02,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:02,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:38:02,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:38:02,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:38:02,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:38:03,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:03,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:03,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:03,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:03,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:03,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:03,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:03,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:03,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:03,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:03,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,530 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,556 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,583 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,610 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:03,660 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:03,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:38:03,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:03,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:03,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:38:03,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:03,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:38:03,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,888 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:38:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:03,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:03,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:38:03,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:03,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-31 17:38:03,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:04,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:04,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-31 17:38:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:04,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:04,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:04,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:38:04,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:04,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:38:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:38:04,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:04,173 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-31 17:38:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:04,992 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-31 17:38:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:38:04,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:38:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:04,998 INFO L225 Difference]: With dead ends: 407 [2019-01-31 17:38:04,998 INFO L226 Difference]: Without dead ends: 401 [2019-01-31 17:38:04,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:38:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-31 17:38:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-31 17:38:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-31 17:38:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-31 17:38:05,077 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-31 17:38:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:05,078 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-31 17:38:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:38:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-31 17:38:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:05,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:05,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:05,079 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:05,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-31 17:38:05,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:38:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:05,371 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-31 17:38:05,834 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-31 17:38:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:05,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:05,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:05,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:05,986 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-31 17:38:05,987 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:05,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:06,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:06,346 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-01-31 17:38:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:06,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:06,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:06,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:06,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:06,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:06,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:06,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:06,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:06,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:06,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:06,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:06,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:06,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:06,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:06,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:06,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:06,826 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,851 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,893 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:06,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:06,994 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:07,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:38:07,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:07,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:07,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:38:07,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:07,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-31 17:38:07,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,202 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:07,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:38:07,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:07,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:38:07,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:07,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:07,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-31 17:38:07,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:07,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:07,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:38:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:07,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:07,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:07,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:38:07,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:07,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:38:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:38:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:07,442 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-31 17:38:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:08,519 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-31 17:38:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 17:38:08,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:38:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:08,527 INFO L225 Difference]: With dead ends: 645 [2019-01-31 17:38:08,527 INFO L226 Difference]: Without dead ends: 643 [2019-01-31 17:38:08,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:38:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-31 17:38:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-31 17:38:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-31 17:38:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-31 17:38:08,630 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-31 17:38:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:08,630 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-31 17:38:08,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:38:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-31 17:38:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:08,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:08,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:08,632 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-31 17:38:08,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:08,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:08,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:08,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:08,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:08,715 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-31 17:38:08,716 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:08,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:08,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:08,929 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:38:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:08,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:08,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:08,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:08,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:08,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:08,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:08,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:08,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:08,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:08,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:08,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:08,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:09,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:38:09,014 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:38:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:38:09,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:38:09,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:38:09,309 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,324 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:09,385 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:38:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:38:09,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:09,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:09,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:38:09,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:09,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:38:09,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:09,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:38:09,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-31 17:38:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:09,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:09,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:09,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:38:09,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:09,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:38:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:38:09,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:38:09,722 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-31 17:38:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:10,277 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-31 17:38:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:38:10,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:38:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:10,284 INFO L225 Difference]: With dead ends: 527 [2019-01-31 17:38:10,284 INFO L226 Difference]: Without dead ends: 524 [2019-01-31 17:38:10,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:38:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-31 17:38:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-31 17:38:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-31 17:38:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-31 17:38:10,405 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-31 17:38:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:10,405 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-31 17:38:10,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:38:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-31 17:38:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:10,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:10,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:10,406 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-31 17:38:10,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:10,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:10,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:10,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:10,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:10,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:10,487 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-31 17:38:10,488 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:10,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:10,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:10,765 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-01-31 17:38:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:10,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:10,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:10,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:10,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:10,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:10,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:10,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:10,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:10,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:10,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:10,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:38:10,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:10,884 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:10,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:10,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:10,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:10,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:38:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:38:11,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:38:11,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:38:11,129 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,145 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:11,210 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:38:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:38:11,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:11,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:38:11,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:38:11,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:11,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-31 17:38:11,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:11,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:11,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:38:11,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:11,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:11,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:38:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:11,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:11,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:11,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:11,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:11,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:11,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:11,511 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-31 17:38:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:12,353 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-31 17:38:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:12,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:12,360 INFO L225 Difference]: With dead ends: 534 [2019-01-31 17:38:12,361 INFO L226 Difference]: Without dead ends: 533 [2019-01-31 17:38:12,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:38:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-31 17:38:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-31 17:38:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-31 17:38:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-31 17:38:12,482 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-31 17:38:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:12,482 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-31 17:38:12,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-31 17:38:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:12,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:12,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:12,484 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-31 17:38:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:12,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:12,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:12,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:12,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:12,565 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-31 17:38:12,566 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:12,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:12,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:12,859 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-01-31 17:38:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:12,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:12,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:12,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:12,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:12,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:12,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:12,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:12,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:12,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:12,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:12,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:12,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:12,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:38:12,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:12,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,016 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:38:13,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:38:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:38:13,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:38:13,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:38:13,290 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,315 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,339 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:13,431 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:38:13,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:38:13,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:13,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:38:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-31 17:38:13,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:13,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-31 17:38:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,629 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:13,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:13,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-31 17:38:13,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:13,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:13,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-31 17:38:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:13,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:13,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-01-31 17:38:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:13,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:13,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:13,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:13,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:13,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:13,763 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-31 17:38:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:14,467 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-31 17:38:14,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:14,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:14,473 INFO L225 Difference]: With dead ends: 543 [2019-01-31 17:38:14,473 INFO L226 Difference]: Without dead ends: 542 [2019-01-31 17:38:14,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:38:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-31 17:38:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-31 17:38:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-31 17:38:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-31 17:38:14,589 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-31 17:38:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-31 17:38:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-31 17:38:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:14,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:14,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:14,592 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-31 17:38:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:14,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:14,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:14,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:14,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:14,659 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-31 17:38:14,659 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:14,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:14,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:14,968 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-01-31 17:38:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:14,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:14,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:14,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:14,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:14,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:14,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:14,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:14,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:15,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:15,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:15,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:38:15,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,097 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:38:15,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:38:15,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:38:15,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:38:15,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:38:15,373 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,399 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,421 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,446 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,473 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:15,519 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:38:15,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:38:15,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:15,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:38:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-31 17:38:15,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:15,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-31 17:38:15,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:15,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:15,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-31 17:38:15,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:15,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:15,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-31 17:38:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:15,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:15,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:15,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:15,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:15,857 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-31 17:38:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:16,559 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-31 17:38:16,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:16,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:16,565 INFO L225 Difference]: With dead ends: 537 [2019-01-31 17:38:16,565 INFO L226 Difference]: Without dead ends: 536 [2019-01-31 17:38:16,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:38:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-31 17:38:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-31 17:38:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-31 17:38:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-31 17:38:16,683 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-31 17:38:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:16,683 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-31 17:38:16,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-31 17:38:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:16,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:16,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:16,684 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-31 17:38:16,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:16,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:16,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:16,959 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:38:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:17,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:17,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:17,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:17,002 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-31 17:38:17,003 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:17,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:17,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:17,463 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-01-31 17:38:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:17,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:17,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:17,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:17,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:17,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:17,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:17,608 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-31 17:38:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:17,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:17,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:17,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:17,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:17,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:17,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,768 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:17,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:17,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:17,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:17,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:18,136 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-31 17:38:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:18,148 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,201 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,255 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:18,303 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:18,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:38:18,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:18,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:18,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:18,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-31 17:38:18,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:18,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-31 17:38:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:18,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-31 17:38:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:18,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:18,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-31 17:38:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:18,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:18,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:18,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:18,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:18,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:18,652 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-31 17:38:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:19,430 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-31 17:38:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:19,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:19,434 INFO L225 Difference]: With dead ends: 588 [2019-01-31 17:38:19,434 INFO L226 Difference]: Without dead ends: 587 [2019-01-31 17:38:19,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:38:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-31 17:38:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-31 17:38:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-31 17:38:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-31 17:38:19,557 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-31 17:38:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:19,557 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-31 17:38:19,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-31 17:38:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:19,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:19,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:19,559 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-31 17:38:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:19,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:19,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:19,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:19,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:19,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:19,629 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-31 17:38:19,630 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:19,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:20,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:20,053 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:38:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:20,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:20,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:20,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:20,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:20,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:20,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:20,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:20,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:20,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:20,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,334 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-31 17:38:20,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:20,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,461 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-31 17:38:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:20,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:38:20,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:38:20,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:38:20,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:38:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:38:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:20,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:38:20,956 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:20,980 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,002 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,028 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,055 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:21,099 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:38:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:38:21,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:21,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:38:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:21,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:21,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-31 17:38:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:21,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:21,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-31 17:38:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:21,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:21,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:21,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:38:21,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:21,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:38:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:38:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:38:21,312 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-31 17:38:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:21,810 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-31 17:38:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:38:21,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:38:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:21,815 INFO L225 Difference]: With dead ends: 558 [2019-01-31 17:38:21,815 INFO L226 Difference]: Without dead ends: 557 [2019-01-31 17:38:21,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:38:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-31 17:38:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-31 17:38:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-31 17:38:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-31 17:38:21,955 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-31 17:38:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:21,955 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-31 17:38:21,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:38:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-31 17:38:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:21,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:21,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:21,957 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-31 17:38:21,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:21,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:22,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:22,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:22,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:22,048 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-31 17:38:22,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:22,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:22,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:22,326 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-01-31 17:38:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:22,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:22,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:22,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:22,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:22,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:22,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:38:22,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:38:22,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:38:22,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:38:22,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:22,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:22,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:22,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:22,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:22,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:38:22,606 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,637 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,682 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,723 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:22,757 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:38:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:38:22,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:22,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:38:22,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,849 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:22,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:38:22,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:22,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-31 17:38:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:22,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-31 17:38:22,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:22,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:22,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-31 17:38:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:22,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:23,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:23,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:38:23,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:23,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:38:23,011 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-31 17:38:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:23,713 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-31 17:38:23,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:38:23,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:23,717 INFO L225 Difference]: With dead ends: 795 [2019-01-31 17:38:23,718 INFO L226 Difference]: Without dead ends: 794 [2019-01-31 17:38:23,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-31 17:38:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-31 17:38:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-31 17:38:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-31 17:38:23,862 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-31 17:38:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:23,862 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-31 17:38:23,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-31 17:38:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:23,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:23,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:23,864 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-31 17:38:23,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:23,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:24,070 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-31 17:38:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:24,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:24,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:24,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:24,112 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-31 17:38:24,113 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:24,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:24,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:24,332 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:38:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:24,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:24,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:24,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:24,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:24,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:24,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:24,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:24,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:24,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:24,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:38:24,410 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:38:24,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:38:24,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:38:24,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:38:24,649 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,665 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,678 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,694 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:24,726 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:38:24,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:38:24,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:24,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:24,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:38:24,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:24,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:24,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-31 17:38:24,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:24,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:38:24,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-31 17:38:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:24,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:38:25,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:25,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:38:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:38:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:38:25,027 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-31 17:38:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:25,784 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-31 17:38:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:38:25,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:38:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:25,788 INFO L225 Difference]: With dead ends: 539 [2019-01-31 17:38:25,789 INFO L226 Difference]: Without dead ends: 538 [2019-01-31 17:38:25,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:38:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-31 17:38:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-31 17:38:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-31 17:38:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-31 17:38:25,987 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-31 17:38:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:25,988 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-31 17:38:25,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:38:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-31 17:38:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:25,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:25,989 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:38:25,989 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-31 17:38:25,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:25,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:25,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:25,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:25,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:26,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:26,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:26,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:38:26,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:38:26,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:26,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:26,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:26,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:26,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:26,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:26,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:26,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:26,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:38:26,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:38:26,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:38:26,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:38:26,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:38:26,455 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,471 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,487 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:26,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:26,536 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:38:26,784 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-31 17:38:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:26,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:38:26,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:26,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-31 17:38:26,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-31 17:38:27,159 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-31 17:38:27,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-31 17:38:27,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:27,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-31 17:38:27,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:27,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:38:27,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-31 17:38:27,648 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-31 17:38:27,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-31 17:38:27,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:27,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-01-31 17:38:27,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:27,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:27,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:38:27,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:27,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-31 17:38:27,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-31 17:38:28,185 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-31 17:38:28,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-31 17:38:28,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:38:28,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:38:28,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:28,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-31 17:38:28,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:28,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-31 17:38:28,872 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-31 17:38:29,012 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 83 [2019-01-31 17:38:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:29,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:29,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:29,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:38:29,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:29,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:38:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:38:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:29,109 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-31 17:38:29,326 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-31 17:38:30,044 WARN L181 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-31 17:38:30,523 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-31 17:38:31,064 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-31 17:38:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:31,972 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-31 17:38:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:38:31,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:38:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:31,978 INFO L225 Difference]: With dead ends: 678 [2019-01-31 17:38:31,978 INFO L226 Difference]: Without dead ends: 673 [2019-01-31 17:38:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:38:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-31 17:38:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-31 17:38:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-31 17:38:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-31 17:38:32,155 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-31 17:38:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:32,155 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-31 17:38:32,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:38:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-31 17:38:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:32,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:32,156 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:38:32,156 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-31 17:38:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:32,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:32,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:32,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:32,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:38:32,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:38:32,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:32,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:32,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:38:32,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:38:32,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:38:32,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:38:32,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:32,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:32,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:32,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:32,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:32,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:32,301 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:32,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:32,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:32,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:32,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:32,666 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,692 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:32,821 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:38:32,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:32,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:32,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:32,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,035 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-31 17:38:33,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:38:33,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:33,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:38:33,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-31 17:38:33,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:33,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-31 17:38:33,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:33,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-01-31 17:38:33,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:33,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:33,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-31 17:38:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:33,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:33,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:38:33,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:33,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:38:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:38:33,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:33,367 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-31 17:38:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:34,239 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-31 17:38:34,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:38:34,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:38:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:34,245 INFO L225 Difference]: With dead ends: 704 [2019-01-31 17:38:34,245 INFO L226 Difference]: Without dead ends: 703 [2019-01-31 17:38:34,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:38:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-31 17:38:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-31 17:38:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-31 17:38:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-31 17:38:34,502 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-31 17:38:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:34,503 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-31 17:38:34,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:38:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-31 17:38:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:34,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:34,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:34,504 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:34,504 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-31 17:38:34,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:34,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:38:34,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:34,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:34,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:34,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:34,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:38:34,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:38:34,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:34,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:34,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:38:34,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:38:34,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:38:34,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:38:34,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:34,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:34,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:34,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:34,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:34,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:34,806 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,857 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:34,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:34,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:34,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:35,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:35,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:35,179 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,206 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,232 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,259 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,286 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:35,333 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:38:35,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:35,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:35,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:38:35,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:35,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:38:35,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:38:35,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:35,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:38:35,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:35,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:35,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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 124 [2019-01-31 17:38:35,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:35,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:35,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:38:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:35,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:35,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:35,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:38:35,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:35,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:38:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:38:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:35,785 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-31 17:38:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:37,159 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-31 17:38:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:38:37,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:38:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:37,168 INFO L225 Difference]: With dead ends: 1218 [2019-01-31 17:38:37,168 INFO L226 Difference]: Without dead ends: 1217 [2019-01-31 17:38:37,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:38:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-31 17:38:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-31 17:38:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-31 17:38:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-31 17:38:37,605 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-31 17:38:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-31 17:38:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:38:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-31 17:38:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:37,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:37,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:37,606 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-31 17:38:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:37,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:38:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:37,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:37,759 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:38:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:37,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:37,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:37,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:37,785 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-31 17:38:37,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:37,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:38,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:38,110 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-01-31 17:38:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:38,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:38,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:38,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:38,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:38,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:38,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:38,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:38,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:38,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:38,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:38,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:38:38,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,270 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:38:38,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:38:38,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:38:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:38:38,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:38:38,568 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,595 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,619 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,673 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:38,720 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:38:38,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:38:38,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:38,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:38:38,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,838 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:38,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-31 17:38:38,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:38,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-31 17:38:38,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:38,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:38:38,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:38,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:38,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-31 17:38:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:39,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:39,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:38:39,056 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-31 17:38:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:39,906 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-31 17:38:39,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:39,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:38:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:39,911 INFO L225 Difference]: With dead ends: 814 [2019-01-31 17:38:39,911 INFO L226 Difference]: Without dead ends: 811 [2019-01-31 17:38:39,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:38:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-31 17:38:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-31 17:38:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-31 17:38:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-31 17:38:40,225 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-31 17:38:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:40,225 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-31 17:38:40,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:38:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-31 17:38:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:40,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:40,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:40,227 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-31 17:38:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:40,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:40,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:40,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:40,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:40,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:40,335 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-31 17:38:40,336 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:40,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:40,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:40,616 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-01-31 17:38:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:40,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:40,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:40,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:40,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:40,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:40,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:40,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:38:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:38:40,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:38:40,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:40,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:38:40,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:40,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:40,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:40,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:40,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:40,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:38:40,911 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,942 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,965 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:40,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:41,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:41,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:41,044 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:38:41,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:38:41,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:41,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:41,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:38:41,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:41,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:38:41,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:41,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:41,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:38:41,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:41,243 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:41,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:38:41,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:41,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:41,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:38:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:41,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:41,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-01-31 17:38:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:38:41,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:38:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:38:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:38:41,359 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-31 17:38:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:42,225 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-31 17:38:42,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:42,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:38:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:42,228 INFO L225 Difference]: With dead ends: 812 [2019-01-31 17:38:42,228 INFO L226 Difference]: Without dead ends: 811 [2019-01-31 17:38:42,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:38:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-31 17:38:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-31 17:38:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-31 17:38:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-31 17:38:42,545 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-31 17:38:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:42,546 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-31 17:38:42,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:38:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-31 17:38:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:42,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:42,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:42,548 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-31 17:38:42,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:42,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:42,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:42,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:42,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:42,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:42,647 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-31 17:38:42,648 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:42,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:42,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:42,875 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:38:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:42,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:42,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:42,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:42,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:42,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:42,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:42,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:42,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:38:42,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:38:42,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:38:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:38:42,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:42,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:38:42,967 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:38:43,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:38:43,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:38:43,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:38:43,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:38:43,281 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,304 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,329 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,352 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,377 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:43,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:43,422 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:38:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:43,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:38:43,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:44,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:38:44,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-31 17:38:44,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:44,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:44,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:44,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:38:44,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:44,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:44,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-31 17:38:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:44,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:44,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:44,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:38:44,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:44,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:38:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:38:44,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:38:44,650 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-31 17:38:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:45,363 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-31 17:38:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:38:45,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:38:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:45,366 INFO L225 Difference]: With dead ends: 843 [2019-01-31 17:38:45,366 INFO L226 Difference]: Without dead ends: 842 [2019-01-31 17:38:45,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:38:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-31 17:38:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-31 17:38:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-31 17:38:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-31 17:38:45,696 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-31 17:38:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:45,697 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-31 17:38:45,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:38:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-31 17:38:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:38:45,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:45,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:38:45,698 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:45,699 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-31 17:38:45,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:45,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:45,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:45,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:38:45,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:45,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:45,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:38:45,762 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-31 17:38:45,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:45,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:46,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:38:46,076 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-01-31 17:38:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:46,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:38:46,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:46,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:38:46,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:46,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:38:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:46,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:38:46,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:38:46,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:38:46,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:38:46,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:38:46,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:38:46,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:38:46,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:38:46,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:38:46,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:38:46,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:38:46,378 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,404 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,424 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,454 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:38:46,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:38:46,500 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:38:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:38:46,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:38:46,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:38:46,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-31 17:38:46,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:46,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-31 17:38:46,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:38:47,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:47,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:47,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:47,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:47,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:47,193 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:47,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-31 17:38:47,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:47,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-31 17:38:47,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-31 17:38:57,597 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-31 17:38:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-31 17:38:57,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:57,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,741 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:57,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-31 17:38:57,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:57,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,871 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:57,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-31 17:38:57,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:57,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:38:57,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:38:57,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:38:57,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:38:58,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-31 17:38:58,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-31 17:38:58,245 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-31 17:38:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:58,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:38:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:58,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:38:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:38:58,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:38:58,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:38:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:38:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=120, Unknown=1, NotChecked=0, Total=182 [2019-01-31 17:38:58,328 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-31 17:38:58,516 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-31 17:38:58,783 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-31 17:38:59,149 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-31 17:39:00,011 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-31 17:39:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:00,352 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-31 17:39:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:39:00,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:39:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:00,355 INFO L225 Difference]: With dead ends: 896 [2019-01-31 17:39:00,355 INFO L226 Difference]: Without dead ends: 895 [2019-01-31 17:39:00,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=119, Invalid=222, Unknown=1, NotChecked=0, Total=342 [2019-01-31 17:39:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-31 17:39:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-31 17:39:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-31 17:39:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-31 17:39:00,683 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-31 17:39:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:00,683 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-31 17:39:00,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-31 17:39:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:00,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:00,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:00,685 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-31 17:39:00,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:00,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:00,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:00,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:00,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:00,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:00,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:00,772 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-31 17:39:00,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:00,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:01,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:01,052 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-01-31 17:39:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:01,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:01,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:01,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:01,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:01,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:01,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:39:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:39:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:39:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:39:01,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:01,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:01,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:01,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:01,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:01,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:39:01,323 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,349 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,370 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:01,446 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-31 17:39:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:39:01,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:01,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-31 17:39:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:39:01,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:01,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-31 17:39:01,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:01,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:01,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:39:01,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:01,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:01,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-31 17:39:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:01,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:39:01,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:39:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:39:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:39:01,872 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-31 17:39:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:03,061 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-31 17:39:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:39:03,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:39:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:03,066 INFO L225 Difference]: With dead ends: 975 [2019-01-31 17:39:03,066 INFO L226 Difference]: Without dead ends: 973 [2019-01-31 17:39:03,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:39:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-31 17:39:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-31 17:39:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-31 17:39:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-31 17:39:03,428 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-31 17:39:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:03,428 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-31 17:39:03,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-31 17:39:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:03,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:03,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:03,431 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-31 17:39:03,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:03,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:03,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:03,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:03,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:03,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:03,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:03,581 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-31 17:39:03,582 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:03,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:03,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:03,835 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:39:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:03,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:03,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:03,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:03,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:03,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:03,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:03,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:03,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:39:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:39:03,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:39:03,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:03,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:39:03,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:39:03,934 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:03,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:03,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:39:04,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:39:04,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:39:04,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:39:04,152 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,167 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,182 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:04,229 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:39:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:39:04,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:04,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:39:04,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-31 17:39:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-31 17:39:04,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:04,482 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:04,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-31 17:39:04,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:04,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:39:04,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-31 17:39:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:04,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:39:04,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:39:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:39:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:39:04,640 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-31 17:39:05,016 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-31 17:39:05,234 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-31 17:39:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:06,075 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-31 17:39:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:39:06,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:39:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:06,078 INFO L225 Difference]: With dead ends: 985 [2019-01-31 17:39:06,078 INFO L226 Difference]: Without dead ends: 984 [2019-01-31 17:39:06,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:39:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-31 17:39:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-31 17:39:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-31 17:39:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-31 17:39:06,447 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-31 17:39:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:06,447 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-31 17:39:06,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:39:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-31 17:39:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:06,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:06,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:06,449 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-31 17:39:06,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:06,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:06,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:06,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:06,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:06,547 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-31 17:39:06,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:06,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:06,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:06,931 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-01-31 17:39:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:06,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:06,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:06,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:06,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:06,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:06,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:06,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:06,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:39:07,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:39:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:39:07,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:39:07,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:39:07,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:07,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:07,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:07,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:07,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:07,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:39:07,380 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,416 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,483 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:07,534 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:39:07,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:39:07,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:07,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:39:07,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:39:07,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:07,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:39:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,766 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:07,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:39:07,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:07,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:39:07,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,864 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:07,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:07,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-31 17:39:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:07,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:07,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:39:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:07,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:08,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:08,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:39:08,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:08,724 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-31 17:39:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:21,301 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-31 17:39:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:39:21,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:21,306 INFO L225 Difference]: With dead ends: 1024 [2019-01-31 17:39:21,306 INFO L226 Difference]: Without dead ends: 1023 [2019-01-31 17:39:21,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:39:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-31 17:39:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-31 17:39:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-31 17:39:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-31 17:39:21,707 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-31 17:39:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:21,707 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-31 17:39:21,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-31 17:39:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:21,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:21,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:21,709 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-31 17:39:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:21,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:21,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:21,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:21,882 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-31 17:39:21,883 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:21,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:22,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:22,240 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-01-31 17:39:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:22,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:22,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:22,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:22,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:22,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:22,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:22,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:22,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:22,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:22,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:22,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:22,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:39:22,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:39:22,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:39:22,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:39:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:39:22,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:39:22,702 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,727 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,753 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,780 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,804 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:22,851 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:39:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:39:22,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:22,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:22,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:39:22,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:22,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:39:22,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:23,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:23,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:39:23,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:23,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:39:23,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:23,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:23,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:39:23,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:23,180 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:23,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-31 17:39:23,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:23,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:23,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-31 17:39:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:23,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:23,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:23,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:39:23,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:39:23,333 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-31 17:39:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:24,722 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-31 17:39:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:39:24,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:24,728 INFO L225 Difference]: With dead ends: 1059 [2019-01-31 17:39:24,728 INFO L226 Difference]: Without dead ends: 1057 [2019-01-31 17:39:24,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:39:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-31 17:39:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-31 17:39:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-31 17:39:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-31 17:39:25,112 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-31 17:39:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:25,112 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-31 17:39:25,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-31 17:39:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:25,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:25,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:25,114 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-31 17:39:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:25,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:25,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:25,254 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-31 17:39:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:25,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:25,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:25,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:25,289 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-31 17:39:25,290 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:25,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:25,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:25,656 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-01-31 17:39:25,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:25,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:25,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:25,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:25,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:25,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:25,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:25,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:25,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:25,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:25,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:25,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:39:25,739 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,767 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:25,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:39:25,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:39:25,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:39:25,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:25,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:39:25,991 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,008 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,023 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,040 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:26,073 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-31 17:39:26,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:39:26,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:26,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:39:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:39:26,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:26,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-31 17:39:26,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,268 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:39:26,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:26,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-31 17:39:26,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:26,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:26,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-31 17:39:26,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:26,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:26,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:39:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:26,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:26,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:26,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:39:26,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:26,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:26,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:26,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:26,480 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-31 17:39:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:28,645 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-31 17:39:28,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:39:28,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:28,649 INFO L225 Difference]: With dead ends: 1044 [2019-01-31 17:39:28,649 INFO L226 Difference]: Without dead ends: 1042 [2019-01-31 17:39:28,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:39:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-31 17:39:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-31 17:39:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-31 17:39:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-31 17:39:29,072 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-31 17:39:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-31 17:39:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-31 17:39:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:29,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:29,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:29,074 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-31 17:39:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:29,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:29,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:29,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:29,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:39:29,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:39:29,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:29,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:29,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:39:29,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:39:29,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:39:29,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:39:29,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:29,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:39:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:39:29,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:39:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:39:29,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:39:29,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:29,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:29,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:29,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:29,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:29,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:39:29,637 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,674 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,711 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:29,786 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:39:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:39:29,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:29,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:39:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:29,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:39:29,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:29,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:29,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:39:30,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:30,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-31 17:39:30,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:30,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:30,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-31 17:39:30,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:30,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:30,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:39:30,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:30,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:30,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-31 17:39:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:30,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:30,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:30,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:39:30,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:30,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:30,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:30,271 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-31 17:39:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:31,585 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-31 17:39:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:39:31,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:31,590 INFO L225 Difference]: With dead ends: 1044 [2019-01-31 17:39:31,590 INFO L226 Difference]: Without dead ends: 1041 [2019-01-31 17:39:31,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:39:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-31 17:39:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-31 17:39:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-31 17:39:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-31 17:39:32,020 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-31 17:39:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:32,021 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-31 17:39:32,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-31 17:39:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:32,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:32,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:32,022 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-31 17:39:32,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:32,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:39:32,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:32,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:32,171 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:39:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:32,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:32,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:32,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:32,228 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-31 17:39:32,229 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:32,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:32,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:32,583 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-01-31 17:39:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:32,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:32,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:32,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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:32,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:32,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:32,786 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:39:32,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:32,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:32,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:32,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:32,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:39:32,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:32,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:39:32,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:32,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:39:33,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:39:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:39:33,084 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:33,124 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:33,140 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:33,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:33,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:33,190 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:39:33,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:39:33,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:33,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:39:33,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-31 17:39:33,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,521 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:33,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-31 17:39:33,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:33,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,687 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:33,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-31 17:39:33,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:33,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-31 17:39:33,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-31 17:39:33,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:33,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-31 17:39:33,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-31 17:39:34,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:34,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-31 17:39:34,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:34,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-31 17:39:34,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-31 17:39:34,446 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-31 17:39:34,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-31 17:39:34,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:34,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:34,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-31 17:39:34,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-31 17:39:34,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:34,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:34,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-31 17:39:34,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:35,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:35,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-31 17:39:35,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:35,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-31 17:39:35,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-31 17:39:35,499 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-31 17:39:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:35,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:35,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:35,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:39:35,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:35,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:35,622 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-31 17:39:35,814 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-31 17:39:36,084 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-31 17:39:36,512 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-31 17:39:36,963 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-31 17:39:37,453 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-31 17:39:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:38,355 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-31 17:39:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:39:38,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:38,359 INFO L225 Difference]: With dead ends: 1104 [2019-01-31 17:39:38,359 INFO L226 Difference]: Without dead ends: 1102 [2019-01-31 17:39:38,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:39:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-31 17:39:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-31 17:39:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-31 17:39:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-31 17:39:38,767 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-31 17:39:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:38,767 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-31 17:39:38,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-31 17:39:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:38,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:38,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:38,769 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-31 17:39:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:38,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:38,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:38,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:38,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:38,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:38,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:38,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:38,871 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-31 17:39:38,871 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:38,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:39,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:39,273 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-01-31 17:39:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:39,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:39,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:39,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:39,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:39,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:39,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:39:39,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:39:39,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:39:39,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:39:39,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:39,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:39,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:39,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:39,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:39,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:39:39,569 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,632 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:39,692 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:39:39,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:39:39,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:39,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:39:39,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:39,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:39:39,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:39,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-31 17:39:39,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:39:39,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:39,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-31 17:39:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:39,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:39,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-31 17:39:39,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:39,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:39,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-31 17:39:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:40,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:40,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:39:40,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:40,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:39:40,081 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-31 17:39:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:42,496 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-31 17:39:42,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:39:42,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:39:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:42,502 INFO L225 Difference]: With dead ends: 1313 [2019-01-31 17:39:42,502 INFO L226 Difference]: Without dead ends: 1312 [2019-01-31 17:39:42,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:39:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-31 17:39:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-31 17:39:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-31 17:39:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-31 17:39:42,925 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-31 17:39:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:42,925 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-31 17:39:42,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:39:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-31 17:39:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:42,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:42,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:42,927 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-31 17:39:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:42,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:43,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:43,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:43,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:43,003 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-31 17:39:43,004 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:43,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:43,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:43,295 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-01-31 17:39:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:43,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:43,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:43,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:43,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:43,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:43,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:43,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:39:43,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:39:43,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:39:43,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:39:43,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:39:43,377 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,841 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:43,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:39:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:39:43,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:43,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:39:44,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:39:44,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:39:44,120 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,145 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,194 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:44,265 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:39:44,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:39:44,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:44,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:39:44,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-31 17:39:44,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:44,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-31 17:39:44,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:44,524 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:44,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-31 17:39:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:44,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:44,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-31 17:39:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:44,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:44,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:44,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:39:44,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:44,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:39:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:39:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:39:44,671 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-31 17:39:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:45,658 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-31 17:39:45,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:39:45,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:39:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:45,661 INFO L225 Difference]: With dead ends: 881 [2019-01-31 17:39:45,661 INFO L226 Difference]: Without dead ends: 880 [2019-01-31 17:39:45,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-01-31 17:39:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-31 17:39:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-31 17:39:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-31 17:39:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-31 17:39:46,056 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-31 17:39:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:46,056 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-31 17:39:46,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-31 17:39:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:46,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:46,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:46,058 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-31 17:39:46,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:46,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:46,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:46,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:46,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:46,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:46,139 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:46,139 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-31 17:39:46,140 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:46,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:46,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:46,417 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-01-31 17:39:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:46,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:46,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:46,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:46,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:46,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:46,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:46,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:46,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:39:46,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:39:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:39:46,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:39:46,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:39:46,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,529 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:39:46,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:39:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:39:46,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:39:46,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,735 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,749 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:46,797 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:39:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-31 17:39:46,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:46,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:46,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-31 17:39:46,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:46,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:39:46,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:47,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:39:47,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-31 17:39:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:47,075 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:47,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:39:47,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:47,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:47,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-31 17:39:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:47,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:47,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:47,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:39:47,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:47,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:39:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:39:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:39:47,158 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-31 17:39:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:48,472 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-31 17:39:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:39:48,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:39:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:48,478 INFO L225 Difference]: With dead ends: 1415 [2019-01-31 17:39:48,479 INFO L226 Difference]: Without dead ends: 1413 [2019-01-31 17:39:48,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:39:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-31 17:39:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-31 17:39:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-31 17:39:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-31 17:39:49,150 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-31 17:39:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:49,151 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-31 17:39:49,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-31 17:39:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:49,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:49,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:49,154 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-31 17:39:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:49,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:49,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:49,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:49,253 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:49,253 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-31 17:39:49,257 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:49,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:49,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:49,603 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-01-31 17:39:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:49,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:49,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:49,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:49,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:49,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:49,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:49,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:39:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:39:49,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:39:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:49,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:39:49,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:49,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:39:49,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:39:49,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:39:49,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:39:49,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:39:49,878 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,954 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:49,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:49,985 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:39:50,175 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-31 17:39:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:39:50,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-31 17:39:50,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-31 17:39:50,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:417 [2019-01-31 17:39:50,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,751 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:50,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 97 [2019-01-31 17:39:50,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:50,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:50,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2019-01-31 17:39:50,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:51,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:51,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 95 [2019-01-31 17:39:51,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:51,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-31 17:39:51,229 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:186, output treesize:180 [2019-01-31 17:39:51,354 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-01-31 17:39:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,362 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:51,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-31 17:39:51,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:51,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:39:51,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:51,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:51,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-31 17:39:51,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:51,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-31 17:39:51,552 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-31 17:39:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:51,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:51,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:51,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:39:51,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:51,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:39:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:39:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:39:51,683 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-31 17:39:52,093 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-31 17:39:52,711 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-31 17:39:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:53,574 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-31 17:39:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:39:53,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:39:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:53,580 INFO L225 Difference]: With dead ends: 1381 [2019-01-31 17:39:53,581 INFO L226 Difference]: Without dead ends: 1379 [2019-01-31 17:39:53,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:39:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-31 17:39:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-31 17:39:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-31 17:39:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-31 17:39:54,295 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-31 17:39:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:54,296 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-31 17:39:54,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:39:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-31 17:39:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:54,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:54,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:54,298 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-31 17:39:54,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:54,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:54,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:54,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:39:54,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:54,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:54,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:54,352 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-31 17:39:54,353 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:54,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:54,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:54,889 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:39:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:54,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:54,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:54,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:54,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:54,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:54,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:54,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:39:54,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:39:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:54,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:39:55,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:39:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:39:55,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:55,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:39:55,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:39:55,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:39:55,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:39:55,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:39:55,306 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,340 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,360 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,375 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,387 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:55,448 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:39:55,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:39:55,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:55,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:55,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:39:55,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:55,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:55,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-31 17:39:55,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:39:55,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-31 17:39:55,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-31 17:39:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:55,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:55,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:55,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:39:55,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:39:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:39:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:39:55,900 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-31 17:39:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:39:57,038 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-31 17:39:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:39:57,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:39:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:39:57,043 INFO L225 Difference]: With dead ends: 1306 [2019-01-31 17:39:57,043 INFO L226 Difference]: Without dead ends: 1305 [2019-01-31 17:39:57,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:39:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-31 17:39:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-31 17:39:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-31 17:39:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-31 17:39:57,699 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-31 17:39:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:39:57,700 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-31 17:39:57,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:39:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-31 17:39:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:39:57,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:39:57,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:39:57,702 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:39:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-31 17:39:57,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:39:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:39:57,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:39:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:57,854 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-31 17:39:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:57,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:57,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:39:57,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:39:57,908 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-31 17:39:57,909 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:39:57,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:39:58,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:39:58,320 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-01-31 17:39:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:39:58,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:39:58,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:39:58,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:39:58,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:39:58,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:39:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:39:58,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:39:58,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:39:58,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:39:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:39:58,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:39:58,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:39:58,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:39:58,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:39:58,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:39:58,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:39:58,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:39:58,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:39:58,767 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,802 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,823 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,840 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,866 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:39:58,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:58,913 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:39:58,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:58,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:39:58,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:59,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:59,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:39:59,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:59,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-31 17:39:59,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:59,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:59,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-31 17:39:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-31 17:39:59,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:59,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:59,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-31 17:39:59,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:39:59,435 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:39:59,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-31 17:39:59,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:39:59,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:39:59,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-31 17:39:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:59,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:39:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:39:59,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:39:59,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:39:59,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:39:59,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:39:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:39:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:39:59,605 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-31 17:40:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:01,242 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-31 17:40:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:40:01,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:40:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:01,248 INFO L225 Difference]: With dead ends: 1360 [2019-01-31 17:40:01,248 INFO L226 Difference]: Without dead ends: 1358 [2019-01-31 17:40:01,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:40:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-31 17:40:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-31 17:40:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-31 17:40:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-31 17:40:01,997 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-31 17:40:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:01,997 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-31 17:40:01,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:40:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-31 17:40:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:40:02,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:02,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:40:02,000 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-31 17:40:02,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:02,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:02,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:02,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:02,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:40:02,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:40:02,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:02,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:02,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:40:02,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:40:02,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:40:02,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:40:02,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:02,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:40:02,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:40:02,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:40:02,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:40:02,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:02,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:40:02,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:02,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:02,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:02,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:02,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:02,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:02,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:40:02,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:40:02,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:40:02,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:40:02,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:40:02,990 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,028 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,049 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,065 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,091 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:03,139 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-31 17:40:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:40:03,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:03,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:40:03,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:40:03,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:03,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-31 17:40:03,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:03,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:03,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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 123 [2019-01-31 17:40:03,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:03,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:03,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-31 17:40:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:03,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:03,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:03,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:40:03,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:03,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:40:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:40:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:40:03,461 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-31 17:40:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:05,201 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-31 17:40:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:40:05,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:40:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:05,207 INFO L225 Difference]: With dead ends: 1898 [2019-01-31 17:40:05,207 INFO L226 Difference]: Without dead ends: 1896 [2019-01-31 17:40:05,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:40:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-31 17:40:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-31 17:40:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-31 17:40:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-31 17:40:06,256 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-31 17:40:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:06,256 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-31 17:40:06,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:40:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-31 17:40:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:40:06,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:06,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:40:06,261 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:06,261 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-31 17:40:06,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:06,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:06,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:40:06,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:06,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:06,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:40:06,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:40:06,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:40:06,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:40:06,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:40:06,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:40:06,362 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-31 17:40:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:07,444 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-31 17:40:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:40:07,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-31 17:40:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:07,449 INFO L225 Difference]: With dead ends: 1693 [2019-01-31 17:40:07,449 INFO L226 Difference]: Without dead ends: 1692 [2019-01-31 17:40:07,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:40:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-31 17:40:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-31 17:40:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-31 17:40:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-31 17:40:08,499 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-31 17:40:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:08,499 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-31 17:40:08,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:40:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-31 17:40:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:40:08,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:08,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:40:08,502 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-31 17:40:08,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:08,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:08,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:08,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:08,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:40:08,552 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-31 17:40:08,553 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:08,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:08,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:08,762 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:40:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:08,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:08,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:08,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:08,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:08,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:08,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:08,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:08,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:40:08,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:40:08,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:40:08,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:40:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:08,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:40:08,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:08,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:40:08,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:40:09,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:40:09,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:40:09,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:40:09,170 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,196 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,220 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,270 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:09,315 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-31 17:40:09,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:40:09,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:09,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:40:09,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:09,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-31 17:40:09,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:09,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:09,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-31 17:40:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:09,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:09,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:09,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:40:09,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:09,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:40:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:40:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:40:09,514 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-31 17:40:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:11,645 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-31 17:40:11,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:40:11,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:40:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:11,653 INFO L225 Difference]: With dead ends: 2759 [2019-01-31 17:40:11,653 INFO L226 Difference]: Without dead ends: 2757 [2019-01-31 17:40:11,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:40:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-31 17:40:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-31 17:40:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-31 17:40:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-31 17:40:13,652 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-31 17:40:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:13,652 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-31 17:40:13,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:40:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-31 17:40:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:40:13,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:13,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:40:13,656 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-31 17:40:13,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:13,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:13,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:13,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:13,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:40:13,774 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-31 17:40:13,775 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:13,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:14,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:14,129 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-01-31 17:40:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:14,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:14,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:14,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:14,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:14,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:14,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:14,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:14,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:40:14,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:40:14,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:40:14,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:40:14,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:40:14,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:40:14,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:40:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:40:14,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:40:14,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:40:14,597 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,624 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,650 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,677 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:14,751 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:40:14,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:40:14,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:14,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:40:14,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,876 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:14,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-31 17:40:14,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:14,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:14,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-31 17:40:14,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:14,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:40:14,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:15,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:15,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-31 17:40:15,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:15,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:15,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:40:15,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:15,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:15,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-31 17:40:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:15,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:15,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:15,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:40:15,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:15,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:40:15,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:40:15,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:40:15,198 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-31 17:40:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:18,765 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-31 17:40:18,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:40:18,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:40:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:18,777 INFO L225 Difference]: With dead ends: 3636 [2019-01-31 17:40:18,777 INFO L226 Difference]: Without dead ends: 3626 [2019-01-31 17:40:18,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:40:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-31 17:40:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-31 17:40:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-31 17:40:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-31 17:40:21,162 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-31 17:40:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:21,162 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-31 17:40:21,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:40:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-31 17:40:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:40:21,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:21,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:40:21,166 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-31 17:40:21,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:21,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:21,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:21,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:21,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:21,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:40:21,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:40:21,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:21,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:21,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:40:21,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:40:21,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:40:21,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:40:21,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:21,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:21,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:40:21,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:40:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:40:21,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:40:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:40:21,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:40:21,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:40:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:40:21,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:40:21,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:40:21,620 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,645 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,670 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,695 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:21,769 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:40:21,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-31 17:40:21,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:21,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:21,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:40:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:21,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:40:21,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:40:22,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:40:22,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-31 17:40:22,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:22,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:22,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:40:22,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:22,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:22,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-31 17:40:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:22,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:22,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:22,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:40:22,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:22,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:40:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:40:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:40:22,213 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-31 17:40:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:26,298 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-31 17:40:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:40:26,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:40:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:26,312 INFO L225 Difference]: With dead ends: 4300 [2019-01-31 17:40:26,312 INFO L226 Difference]: Without dead ends: 4298 [2019-01-31 17:40:26,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:40:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-31 17:40:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-31 17:40:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-31 17:40:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-31 17:40:29,910 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-31 17:40:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:29,910 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-31 17:40:29,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:40:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-31 17:40:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:40:29,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:29,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:29,916 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-31 17:40:29,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:29,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:29,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:40:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:29,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:29,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:29,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:29,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:40:29,998 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-31 17:40:29,998 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:29,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:30,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:30,358 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:40:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:30,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:30,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:30,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:30,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:30,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:30,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:30,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:40:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:40:30,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:40:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:40:30,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:40:30,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:40:30,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:40:30,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:40:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:40:30,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:30,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:40:30,811 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,851 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,878 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,905 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:30,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:30,979 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:40:31,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:40:31,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:31,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:31,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:40:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:40:31,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:31,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:31,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-31 17:40:31,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:31,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-31 17:40:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:31,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:31,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-31 17:40:31,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,303 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:31,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:31,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:40:31,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:31,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:31,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-31 17:40:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:31,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:31,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:40:31,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:31,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:40:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:40:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:40:31,464 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-31 17:40:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:35,819 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-31 17:40:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:40:35,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:40:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:35,833 INFO L225 Difference]: With dead ends: 4236 [2019-01-31 17:40:35,833 INFO L226 Difference]: Without dead ends: 4233 [2019-01-31 17:40:35,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:40:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-31 17:40:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-31 17:40:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-31 17:40:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-31 17:40:39,469 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-31 17:40:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:39,470 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-31 17:40:39,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:40:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-31 17:40:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:40:39,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:39,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:39,476 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-31 17:40:39,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:39,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:39,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:39,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:39,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:40:39,571 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-31 17:40:39,571 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:39,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:39,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:39,914 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:40:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:39,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:39,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:39,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:39,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:39,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:39,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:40:39,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:40:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:40:40,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:40:40,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:40,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:40:40,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:40:40,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:40:40,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:40:40,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:40:40,197 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,223 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,244 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,277 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:40,403 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-31 17:40:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:40:40,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:40,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:40:40,673 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-31 17:40:40,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:40:40,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:40,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:40:40,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:40,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-31 17:40:40,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:40,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-31 17:40:40,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:40,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:40,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:40:40,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:40,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:40,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:40:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:40,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:40,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:40:40,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:40,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:40:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:40:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:40:40,971 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-31 17:40:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:45,223 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-31 17:40:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:40:45,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:40:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:45,236 INFO L225 Difference]: With dead ends: 4232 [2019-01-31 17:40:45,237 INFO L226 Difference]: Without dead ends: 4231 [2019-01-31 17:40:45,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:40:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-31 17:40:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-31 17:40:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-31 17:40:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-31 17:40:48,931 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-31 17:40:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-31 17:40:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:40:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-31 17:40:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:40:48,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:48,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:48,938 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-31 17:40:48,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:48,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:48,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:49,107 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-31 17:40:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:49,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:49,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:49,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:40:49,171 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-31 17:40:49,172 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:49,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:49,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:49,465 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:40:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:49,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:49,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:49,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:49,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:49,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:49,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:49,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:40:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:40:49,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:40:49,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:40:49,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:40:49,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:49,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:40:49,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:40:49,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:40:49,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:40:49,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:40:49,960 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:49,992 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,011 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,026 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,038 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:50,095 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:40:50,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:40:50,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:50,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:40:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:40:50,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:40:50,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:40:50,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-31 17:40:50,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,461 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:40:50,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:50,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:40:50,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:50,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:40:50,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-31 17:40:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:50,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:40:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:40:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:40:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:40:50,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:40:50,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:40:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:40:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:40:50,576 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-31 17:40:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:40:54,796 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-31 17:40:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:40:54,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:40:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:40:54,811 INFO L225 Difference]: With dead ends: 4570 [2019-01-31 17:40:54,811 INFO L226 Difference]: Without dead ends: 4569 [2019-01-31 17:40:54,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:40:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-31 17:40:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-31 17:40:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-31 17:40:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-31 17:40:58,624 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-31 17:40:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:40:58,624 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-31 17:40:58,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:40:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-31 17:40:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:40:58,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:40:58,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:40:58,631 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:40:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-31 17:40:58,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:40:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:40:58,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:40:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:40:58,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:58,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:40:58,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:40:58,866 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-31 17:40:58,867 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:40:58,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:40:59,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:40:59,677 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:40:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:40:59,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:40:59,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:40:59,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:40:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:40:59,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:40:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:40:59,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:40:59,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:40:59,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:40:59,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:40:59,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:40:59,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:40:59,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:40:59,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,851 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:40:59,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:40:59,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:40:59,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:41:00,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:41:00,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:41:00,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:41:00,174 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,201 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,227 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,253 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,281 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:00,326 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:41:00,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:41:00,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:00,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:41:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:41:00,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:00,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-31 17:41:00,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,644 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:00,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:41:00,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:00,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-31 17:41:00,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:00,745 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:00,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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 131 [2019-01-31 17:41:00,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:00,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:00,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-31 17:41:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:00,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:00,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:00,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:41:00,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:00,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:41:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:41:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:41:00,938 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-31 17:41:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:07,056 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-31 17:41:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:41:07,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:41:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:07,075 INFO L225 Difference]: With dead ends: 5928 [2019-01-31 17:41:07,075 INFO L226 Difference]: Without dead ends: 5927 [2019-01-31 17:41:07,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:41:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-31 17:41:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-31 17:41:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-31 17:41:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-31 17:41:12,273 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-31 17:41:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:12,274 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-31 17:41:12,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:41:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-31 17:41:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:41:12,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:12,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:12,281 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-31 17:41:12,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:12,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:12,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:41:12,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:12,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:12,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:41:12,407 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-31 17:41:12,408 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:12,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:12,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:12,685 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:41:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:12,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:12,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:12,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:41:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:12,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:12,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:41:12,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:41:12,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:41:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:41:12,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:41:12,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:41:12,772 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:41:12,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:41:12,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:41:12,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:12,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:41:12,982 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:12,998 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,011 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,028 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:13,059 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-31 17:41:13,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-31 17:41:13,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:13,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-31 17:41:13,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:41:13,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:41:13,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:41:13,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-31 17:41:13,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:13,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-31 17:41:13,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:13,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:13,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-31 17:41:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:13,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:41:13,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-31 17:41:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:13,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:13,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:13,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:41:13,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:41:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:41:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:41:13,560 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-31 17:41:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:20,673 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-31 17:41:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:41:20,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:41:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:20,694 INFO L225 Difference]: With dead ends: 6511 [2019-01-31 17:41:20,695 INFO L226 Difference]: Without dead ends: 6510 [2019-01-31 17:41:20,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:41:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-31 17:41:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-31 17:41:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-31 17:41:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-31 17:41:27,453 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-31 17:41:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:27,454 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-31 17:41:27,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:41:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-31 17:41:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:41:27,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:27,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:27,462 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-31 17:41:27,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:27,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:27,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:27,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:27,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:41:27,794 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-31 17:41:27,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:27,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:28,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:28,181 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:41:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:28,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:28,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:28,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:41:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:28,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:28,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:28,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:41:28,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:41:28,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:41:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:41:28,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:41:28,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:41:28,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:41:28,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:41:28,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:41:28,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:41:28,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:41:28,554 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,586 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,604 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,619 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:28,687 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-31 17:41:28,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:41:28,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:28,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-31 17:41:28,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:41:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:28,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-31 17:41:28,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:28,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-31 17:41:28,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:28,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:28,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-31 17:41:28,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:28,986 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:41:28,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-31 17:41:28,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:29,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:29,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:41:29,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-01-31 17:41:29,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:41:29,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:41:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:41:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:41:29,147 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-31 17:41:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:38,192 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-31 17:41:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:41:38,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-31 17:41:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:38,215 INFO L225 Difference]: With dead ends: 7179 [2019-01-31 17:41:38,216 INFO L226 Difference]: Without dead ends: 7170 [2019-01-31 17:41:38,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:41:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-31 17:41:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-31 17:41:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-31 17:41:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-31 17:41:45,037 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-31 17:41:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:45,037 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-31 17:41:45,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:41:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-31 17:41:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:41:45,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:45,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:41:45,045 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-31 17:41:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:45,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:45,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:45,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:45,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:45,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:41:45,105 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-31 17:41:45,106 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:45,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:45,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:41:45,319 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:41:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:45,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:41:45,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:45,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:41:45,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:45,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:41:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:45,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:41:45,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-31 17:41:45,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-31 17:41:45,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-31 17:41:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-31 17:41:45,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-31 17:41:45,451 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:41:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:41:45,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:41:45,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-31 17:41:45,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-31 17:41:45,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:41:45,580 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,606 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,618 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,631 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,643 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,655 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:41:45,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:45,687 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-31 17:41:45,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:45,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-31 17:41:45,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:41:46,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-31 17:41:46,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-01-31 17:41:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:46,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:46,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:46,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:41:46,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-31 17:41:46,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:41:46,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:41:46,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-31 17:41:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:46,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:41:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:46,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:41:46,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:41:46,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:41:46,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:41:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:41:46,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:41:46,151 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-31 17:41:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:56,216 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-31 17:41:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:41:56,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:41:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:56,257 INFO L225 Difference]: With dead ends: 10441 [2019-01-31 17:41:56,257 INFO L226 Difference]: Without dead ends: 10440 [2019-01-31 17:41:56,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:41:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-31 17:42:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-31 17:42:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-31 17:42:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-31 17:42:07,262 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-31 17:42:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:07,263 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-31 17:42:07,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:42:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-31 17:42:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:42:07,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:07,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:07,273 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-31 17:42:07,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:07,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:07,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:42:07,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:07,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:07,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:42:07,377 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-31 17:42:07,379 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:42:07,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:07,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:42:07,673 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:42:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:07,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:42:07,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:07,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:42:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:07,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:42:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:07,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:07,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:42:07,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:42:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:42:07,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:42:07,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:42:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:42:07,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,848 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:07,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:42:07,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:42:07,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:07,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:42:08,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:42:08,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:42:08,079 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,101 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,123 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,148 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:08,217 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:42:08,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:42:08,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:08,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-31 17:42:08,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,323 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:08,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-31 17:42:08,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:08,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:08,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-31 17:42:08,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:08,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:08,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-31 17:42:08,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:42:08,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-31 17:42:08,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-31 17:42:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:08,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:08,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:42:08,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:08,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:42:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:42:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:42:08,662 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-31 17:42:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:18,891 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-31 17:42:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:42:18,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:42:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:18,931 INFO L225 Difference]: With dead ends: 10427 [2019-01-31 17:42:18,931 INFO L226 Difference]: Without dead ends: 10426 [2019-01-31 17:42:18,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:42:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-31 17:42:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-31 17:42:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-31 17:42:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-31 17:42:29,410 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-31 17:42:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:29,410 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-31 17:42:29,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:42:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-31 17:42:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:42:29,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:29,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:42:29,421 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-31 17:42:29,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:29,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:29,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:29,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:29,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:29,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:29,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:42:29,533 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-31 17:42:29,534 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:42:29,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:29,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:42:29,875 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:42:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:29,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:42:29,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:29,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:42:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:29,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:42:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:29,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:42:29,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:42:29,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:42:29,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:42:29,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:29,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:42:29,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:42:29,948 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:29,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:29,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:42:30,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:42:30,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:42:30,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:42:30,169 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,199 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,215 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:30,246 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-31 17:42:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:42:30,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:30,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:42:30,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:30,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:42:30,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:30,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-31 17:42:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-31 17:42:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:30,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:42:30,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:30,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:30,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:42:30,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:30,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:30,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:42:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:30,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:30,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:30,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:42:30,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:30,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:42:30,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:42:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:42:30,567 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-31 17:42:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:42:42,005 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-31 17:42:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:42:42,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:42:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:42:42,051 INFO L225 Difference]: With dead ends: 11408 [2019-01-31 17:42:42,051 INFO L226 Difference]: Without dead ends: 11406 [2019-01-31 17:42:42,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:42:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-31 17:42:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-31 17:42:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-31 17:42:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-31 17:42:53,235 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-31 17:42:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:42:53,235 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-31 17:42:53,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:42:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-31 17:42:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:42:53,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:42:53,246 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:42:53,246 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:42:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-31 17:42:53,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:42:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:42:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:42:53,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:42:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:42:53,405 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-01-31 17:42:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:42:53,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:53,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:42:53,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:42:53,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:42:53,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:42:53,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:42:53,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:42:53,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:42:53,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:42:53,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:42:53,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:42:53,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:42:53,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:42:53,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:42:53,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:42:53,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:42:53,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:42:53,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,762 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:53,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:42:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:42:53,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:53,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:42:54,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:42:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:42:54,086 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,113 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,139 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,165 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,239 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:42:54,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:42:54,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:42:54,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:42:54,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-31 17:42:54,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,523 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:54,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 17:42:54,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-31 17:42:54,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,615 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:42:54,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-31 17:42:54,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-31 17:42:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:42:54,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-31 17:42:54,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:42:54,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:42:54,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-31 17:42:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:54,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:42:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:42:54,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:42:54,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:42:54,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:42:54,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:42:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:42:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:42:54,895 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-31 17:43:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:10,055 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-31 17:43:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:43:10,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-31 17:43:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:10,110 INFO L225 Difference]: With dead ends: 14692 [2019-01-31 17:43:10,110 INFO L226 Difference]: Without dead ends: 14688 [2019-01-31 17:43:10,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:43:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-31 17:43:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-31 17:43:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-31 17:43:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-31 17:43:23,208 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-31 17:43:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:23,208 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-31 17:43:23,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:43:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-31 17:43:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:43:23,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:23,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:43:23,225 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-31 17:43:23,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:23,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:43:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:23,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:23,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:23,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:23,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:43:23,288 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-31 17:43:23,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:23,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:23,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:23,616 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:43:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:23,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:23,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:23,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:43:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:23,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:23,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:23,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:43:23,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:43:23,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:43:23,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:43:23,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:43:23,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:43:23,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,727 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,747 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:23,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:43:23,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:43:23,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:43:23,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:43:23,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:23,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:43:23,990 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,012 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,034 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:24,122 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:43:24,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-31 17:43:24,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:24,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-31 17:43:24,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-31 17:43:24,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:24,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-31 17:43:24,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,330 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:43:24,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:24,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:43:24,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:24,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:24,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-31 17:43:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:24,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:24,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:43:24,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:24,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:43:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:43:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:43:24,450 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-31 17:43:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:43:37,527 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-31 17:43:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:43:37,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:43:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:43:37,569 INFO L225 Difference]: With dead ends: 13016 [2019-01-31 17:43:37,569 INFO L226 Difference]: Without dead ends: 13015 [2019-01-31 17:43:37,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:43:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-31 17:43:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-31 17:43:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-31 17:43:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-31 17:43:50,532 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-31 17:43:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:43:50,532 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-31 17:43:50,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:43:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-31 17:43:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:43:50,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:43:50,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:43:50,544 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:43:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-31 17:43:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:43:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:50,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:43:50,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:43:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:50,855 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-31 17:43:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:43:50,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:50,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:43:50,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:43:50,864 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-31 17:43:50,865 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:43:50,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:43:51,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:43:51,019 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-01-31 17:43:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:43:51,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:43:51,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:43:51,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:43:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:43:51,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:43:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:43:51,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:43:51,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:43:51,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:43:51,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:43:51,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:43:51,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:43:51,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:43:51,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:43:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:43:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:43:51,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:43:51,284 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,298 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,311 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:51,355 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-31 17:43:51,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:43:51,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:43:51,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:43:51,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-31 17:43:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:43:51,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:43:51,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:43:51,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:43:51,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-31 17:43:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:51,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:43:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:43:51,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:43:51,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:43:51,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:43:51,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:43:51,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:43:51,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:43:51,602 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-31 17:44:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:44:03,903 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-31 17:44:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:44:03,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:44:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:44:03,948 INFO L225 Difference]: With dead ends: 12974 [2019-01-31 17:44:03,948 INFO L226 Difference]: Without dead ends: 12973 [2019-01-31 17:44:03,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:44:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-31 17:44:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-31 17:44:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-31 17:44:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-31 17:44:17,417 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-31 17:44:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:44:17,417 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-31 17:44:17,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:44:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-31 17:44:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:44:17,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:44:17,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:44:17,428 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:44:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-31 17:44:17,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:44:17,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:17,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:17,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:17,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:44:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:44:17,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:17,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:44:17,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:44:17,540 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-31 17:44:17,541 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:44:17,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:44:17,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:44:17,839 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:44:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:17,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:44:17,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:17,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:44:17,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:17,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:44:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:17,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:44:17,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:44:17,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:44:17,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:44:17,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:44:17,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:44:17,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:17,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:44:17,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:17,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:17,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:17,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:17,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:44:18,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:44:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:44:18,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:44:18,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:44:18,212 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,235 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,258 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,282 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,307 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:18,348 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:44:18,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:44:18,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:44:18,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:44:18,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-31 17:44:18,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,590 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:18,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:44:18,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:18,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-31 17:44:18,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:18,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:44:18,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:18,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:18,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-31 17:44:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:18,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:44:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:18,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:44:18,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:44:18,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:44:18,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:44:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:44:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:44:18,768 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-31 17:44:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:44:31,638 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-31 17:44:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:44:31,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:44:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:44:31,681 INFO L225 Difference]: With dead ends: 13106 [2019-01-31 17:44:31,682 INFO L226 Difference]: Without dead ends: 13105 [2019-01-31 17:44:31,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:44:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-31 17:44:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-31 17:44:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-31 17:44:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-31 17:44:44,695 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-31 17:44:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:44:44,695 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-31 17:44:44,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:44:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-31 17:44:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:44:44,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:44:44,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:44:44,705 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:44:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-31 17:44:44,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:44:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:44:44,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:44:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:44:44,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:44,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:44:44,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:44:44,823 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-31 17:44:44,823 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:44:44,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:44:45,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:44:45,179 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:44:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:44:45,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:44:45,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:44:45,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:44:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:44:45,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:44:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:44:45,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:44:45,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:44:45,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:44:45,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:44:45,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:44:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:44:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:44:45,246 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,285 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,307 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:44:45,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:44:45,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:44:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:44:45,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:44:45,591 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,616 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,639 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:45,730 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:44:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:44:45,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:45,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:44:45,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,861 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:45,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-31 17:44:45,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:45,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-31 17:44:45,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:45,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:44:45,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:45,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:45,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-31 17:44:46,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:44:46,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:44:46,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-31 17:44:46,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:44:46,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:44:46,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-31 17:44:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:46,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:44:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:44:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:44:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:44:46,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:44:46,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:44:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:44:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:44:46,206 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-31 17:45:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:00,093 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-31 17:45:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:45:00,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:45:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:00,139 INFO L225 Difference]: With dead ends: 13278 [2019-01-31 17:45:00,139 INFO L226 Difference]: Without dead ends: 13277 [2019-01-31 17:45:00,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:45:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-31 17:45:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-31 17:45:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-31 17:45:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-31 17:45:13,205 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-31 17:45:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:45:13,206 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-31 17:45:13,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:45:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-31 17:45:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:45:13,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:45:13,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:45:13,216 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:45:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-31 17:45:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:45:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:13,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:13,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:45:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:13,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:13,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:45:13,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:45:13,363 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-31 17:45:13,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:45:13,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:45:13,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:45:13,706 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:45:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:13,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:45:13,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:13,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:45:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:13,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:45:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:13,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:45:13,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:45:13,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:45:13,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:45:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:45:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:45:13,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:45:13,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:13,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:45:13,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:45:13,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:13,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:45:14,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:45:14,013 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,029 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,044 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,059 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:14,090 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:45:14,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:45:14,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:14,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-31 17:45:14,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:14,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:45:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:14,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-31 17:45:14,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:45:14,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:14,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-31 17:45:14,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:14,354 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:14,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:45:14,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:14,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:14,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-31 17:45:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:14,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:45:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:45:14,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:45:14,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:45:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:45:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:45:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:45:14,485 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-31 17:45:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:30,912 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-31 17:45:30,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:45:30,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-31 17:45:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:30,979 INFO L225 Difference]: With dead ends: 17581 [2019-01-31 17:45:30,979 INFO L226 Difference]: Without dead ends: 17580 [2019-01-31 17:45:30,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:45:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-31 17:45:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-31 17:45:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-31 17:45:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-31 17:45:42,098 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-31 17:45:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:45:42,099 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-31 17:45:42,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:45:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-31 17:45:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:45:42,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:45:42,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:45:42,107 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:45:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-31 17:45:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:45:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:42,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:45:42,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:45:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:45:42,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:42,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:45:42,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:45:42,174 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-31 17:45:42,174 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:45:42,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:45:42,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:45:42,384 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:45:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:45:42,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:45:42,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:45:42,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:45:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:45:42,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:45:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:45:42,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:45:42,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:45:42,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:45:42,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:45:42,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:45:42,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:45:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:45:42,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:45:42,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:45:42,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:45:42,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:45:42,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:45:42,752 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,775 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,798 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:45:42,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:42,888 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:45:42,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:42,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:45:42,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:45:43,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:45:43,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-31 17:45:43,185 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-01-31 17:45:43,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:43,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:45:43,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:45:43,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:45:43,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:45:43,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:45:43,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-31 17:45:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:43,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:45:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:45:43,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:45:43,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:45:43,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:45:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:45:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:45:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:45:43,284 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-31 17:45:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:45:53,100 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-31 17:45:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:45:53,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:45:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:45:53,135 INFO L225 Difference]: With dead ends: 9947 [2019-01-31 17:45:53,135 INFO L226 Difference]: Without dead ends: 9946 [2019-01-31 17:45:53,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-01-31 17:45:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-31 17:46:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-31 17:46:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-31 17:46:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-31 17:46:03,429 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-31 17:46:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:03,429 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-31 17:46:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:46:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-31 17:46:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:46:03,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:46:03,437 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:46:03,437 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:46:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-31 17:46:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:46:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:03,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:46:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:46:03,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:03,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:46:03,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:46:03,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:46:03,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:03,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:46:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:46:03,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:46:03,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:46:03,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:46:03,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:46:03,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:46:03,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:46:03,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:46:03,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:46:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:46:03,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-31 17:46:03,659 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-31 17:46:03,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-31 17:46:03,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-31 17:46:03,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:03,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-31 17:46:03,893 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,924 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:03,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:03,970 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-31 17:46:04,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-31 17:46:04,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:46:04,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-31 17:46:04,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-31 17:46:04,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,293 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:04,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-31 17:46:04,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:04,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-31 17:46:04,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-31 17:46:04,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-31 17:46:04,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-31 17:46:04,861 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-31 17:46:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:04,875 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:04,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-31 17:46:04,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:46:05,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,153 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:05,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-31 17:46:05,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-31 17:46:05,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-31 17:46:05,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-31 17:46:05,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-31 17:46:05,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-31 17:46:05,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-31 17:46:05,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-31 17:46:05,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:05,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-31 17:46:05,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-31 17:46:05,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:05,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:06,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-31 17:46:06,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:06,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-31 17:46:06,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:06,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,283 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-31 17:46:06,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:06,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:06,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-31 17:46:06,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:06,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-31 17:46:06,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-31 17:46:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:06,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:46:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:06,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:46:06,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:46:06,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:46:06,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:46:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:46:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:46:06,736 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-31 17:46:06,913 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-31 17:46:07,184 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-31 17:46:07,470 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-31 17:46:08,649 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-31 17:46:10,121 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-31 17:46:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:46:22,186 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-31 17:46:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:46:22,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-31 17:46:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:46:22,229 INFO L225 Difference]: With dead ends: 12394 [2019-01-31 17:46:22,229 INFO L226 Difference]: Without dead ends: 12392 [2019-01-31 17:46:22,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:46:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-31 17:46:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-31 17:46:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-31 17:46:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-31 17:46:31,180 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-31 17:46:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:31,180 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-31 17:46:31,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:46:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-31 17:46:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:46:31,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:46:31,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:46:31,189 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:46:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-31 17:46:31,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:46:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:31,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:46:31,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:31,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:46:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:46:31,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:31,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:46:31,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:46:31,270 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-31 17:46:31,270 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:46:31,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:46:31,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:46:31,629 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:46:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:31,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:46:31,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:31,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:46:31,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:31,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:46:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:31,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:46:31,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:46:31,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:46:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:46:31,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:46:31,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:46:31,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:46:31,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:31,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:46:31,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:46:31,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:46:31,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:46:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:31,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:46:31,988 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,011 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,034 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:32,121 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-31 17:46:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:46:32,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:46:32,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:46:32,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-31 17:46:32,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-31 17:46:32,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-01-31 17:46:32,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:46:32,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-31 17:46:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,619 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-31 17:46:32,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,702 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:32,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:32,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-01-31 17:46:32,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:32,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-31 17:46:32,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-31 17:46:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:32,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:46:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:32,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:46:32,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:46:32,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:46:32,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:46:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:46:32,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:46:32,943 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-31 17:46:34,225 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-31 17:46:35,880 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-31 17:46:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:46:43,825 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-31 17:46:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:46:43,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:46:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:46:43,848 INFO L225 Difference]: With dead ends: 7367 [2019-01-31 17:46:43,848 INFO L226 Difference]: Without dead ends: 7366 [2019-01-31 17:46:43,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:46:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-31 17:46:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-31 17:46:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-31 17:46:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-31 17:46:52,969 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-31 17:46:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:46:52,969 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-31 17:46:52,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:46:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-31 17:46:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:46:52,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:46:52,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:46:52,975 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:46:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:46:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-31 17:46:52,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:46:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:46:52,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:46:52,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:46:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:46:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:46:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:53,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:46:53,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:46:53,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:46:53,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:46:53,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:46:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:46:53,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:46:53,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:46:53,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:46:53,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:46:53,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:46:53,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:46:53,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:46:53,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:46:53,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:46:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:46:53,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:46:53,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:46:53,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:46:53,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:46:53,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:46:53,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,568 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,592 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,642 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:53,686 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-31 17:46:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:46:53,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:53,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-31 17:46:53,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:46:53,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:53,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-31 17:46:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,891 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:53,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-31 17:46:53,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:53,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:53,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-31 17:46:53,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:46:53,981 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:46:53,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-31 17:46:53,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:46:54,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:46:54,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-31 17:46:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:54,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:46:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:46:54,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:46:54,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:46:54,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:46:54,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:46:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:46:54,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:46:54,118 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-31 17:47:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:47:10,013 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-31 17:47:10,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:47:10,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:47:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:47:10,045 INFO L225 Difference]: With dead ends: 9936 [2019-01-31 17:47:10,045 INFO L226 Difference]: Without dead ends: 9935 [2019-01-31 17:47:10,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:47:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-31 17:47:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-31 17:47:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-31 17:47:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-31 17:47:23,543 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-31 17:47:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:47:23,543 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-31 17:47:23,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:47:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-31 17:47:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:47:23,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:47:23,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:47:23,550 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:47:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:47:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-31 17:47:23,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:47:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:47:23,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:47:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:47:23,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:47:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:47:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:47:23,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:47:23,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:47:23,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:47:23,661 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-31 17:47:23,661 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:47:23,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:47:24,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:47:24,063 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:47:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:47:24,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:47:24,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:47:24,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:47:24,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:47:24,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:47:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:47:24,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:47:24,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-31 17:47:24,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-31 17:47:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-31 17:47:24,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-31 17:47:24,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-31 17:47:24,258 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:47:24,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:47:24,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:47:24,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:47:24,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:47:24,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-31 17:47:24,406 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,438 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,455 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,480 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:47:24,533 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-31 17:47:24,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:47:24,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:47:24,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-31 17:47:24,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-31 17:47:24,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:47:24,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:47:24,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:47:24,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-31 17:47:24,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:24,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-31 17:47:24,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:24,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:47:24,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-31 17:47:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:47:24,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:47:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:47:24,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:47:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:47:24,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:47:24,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:47:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:47:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:47:24,913 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-31 17:47:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:47:39,363 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-31 17:47:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:47:39,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:47:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:47:39,393 INFO L225 Difference]: With dead ends: 9235 [2019-01-31 17:47:39,393 INFO L226 Difference]: Without dead ends: 9232 [2019-01-31 17:47:39,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:47:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-31 17:47:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-31 17:47:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-31 17:47:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-31 17:47:53,728 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-31 17:47:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:47:53,729 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-31 17:47:53,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:47:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-31 17:47:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:47:53,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:47:53,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:47:53,736 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:47:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:47:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-31 17:47:53,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:47:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:47:53,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:47:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:47:53,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:47:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:47:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:47:53,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:47:53,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:47:53,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:47:53,815 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-31 17:47:53,816 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:47:53,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:47:54,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:47:54,026 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:47:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:47:54,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:47:54,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:47:54,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:47:54,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:47:54,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:47:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:47:54,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:47:54,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-31 17:47:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-31 17:47:54,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-31 17:47:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-31 17:47:54,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:47:54,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-31 17:47:54,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:47:54,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:47:54,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-31 17:47:54,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-31 17:47:54,242 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,282 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,295 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,305 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:47:54,345 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-31 17:47:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:47:54,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:47:54,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:47:54,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-31 17:47:54,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:47:54,527 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:47:54,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:47:54,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:47:54,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:47:54,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-31 17:47:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:47:54,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:47:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:47:54,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:47:54,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:47:54,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:47:54,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:47:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:47:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:47:54,606 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-31 17:48:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:48:08,403 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-31 17:48:08,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:48:08,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:48:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:48:08,432 INFO L225 Difference]: With dead ends: 9065 [2019-01-31 17:48:08,432 INFO L226 Difference]: Without dead ends: 9064 [2019-01-31 17:48:08,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:48:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-31 17:48:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-31 17:48:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-31 17:48:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-31 17:48:22,612 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-31 17:48:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:48:22,612 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-31 17:48:22,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:48:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-31 17:48:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:48:22,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:48:22,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:48:22,620 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:48:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:48:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-31 17:48:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:48:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:48:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:48:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:48:22,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:48:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:48:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:48:22,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:48:22,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:48:22,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:48:22,701 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-31 17:48:22,701 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:48:22,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:48:23,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:48:23,230 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-31 17:48:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:48:23,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:48:23,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:48:23,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:48:23,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:48:23,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:48:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:48:23,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:48:23,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:48:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:48:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:48:23,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:48:23,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:48:23,483 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:48:23,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:48:23,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:48:23,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:48:23,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:48:23,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:48:23,666 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,700 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,720 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,735 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,801 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-31 17:48:23,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:48:23,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:48:23,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-31 17:48:23,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:23,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:48:23,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:23,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:48:23,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-31 17:48:24,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,047 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:48:24,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-31 17:48:24,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:24,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:48:24,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-31 17:48:24,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,142 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:48:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-31 17:48:24,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:24,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:48:24,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-31 17:48:24,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:48:24,238 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:48:24,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-31 17:48:24,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:48:24,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:48:24,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-31 17:48:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:48:24,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:48:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:48:24,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:48:24,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:48:24,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:48:24,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:48:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:48:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:48:24,423 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-31 17:48:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:48:50,682 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-31 17:48:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:48:50,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 17:48:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:48:50,714 INFO L225 Difference]: With dead ends: 9411 [2019-01-31 17:48:50,714 INFO L226 Difference]: Without dead ends: 9409 [2019-01-31 17:48:50,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-01-31 17:48:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-31 17:49:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-31 17:49:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-31 17:49:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-31 17:49:05,360 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-31 17:49:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:49:05,360 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-31 17:49:05,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:49:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-31 17:49:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:49:05,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:49:05,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:49:05,368 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:49:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:49:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-31 17:49:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:49:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:49:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:49:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:49:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:49:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:49:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:49:05,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:49:05,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:49:05,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:49:05,514 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-31 17:49:05,515 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:49:05,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:49:05,934 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:49:05,934 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-31 17:49:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:49:05,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:49:05,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:49:05,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:49:05,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:49:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:49:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:49:05,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:49:05,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:05,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-31 17:49:06,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-31 17:49:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-31 17:49:06,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-31 17:49:06,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 17:49:06,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-31 17:49:06,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-31 17:49:06,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:49:06,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-31 17:49:06,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-31 17:49:06,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:49:06,324 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,356 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,376 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,458 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-31 17:49:06,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-31 17:49:06,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-31 17:49:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:49:06,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-31 17:49:06,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-31 17:49:06,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:49:06,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-31 17:49:06,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,772 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:49:06,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-31 17:49:06,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-31 17:49:06,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,864 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:49:06,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:49:06,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-31 17:49:06,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:49:06,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:49:06,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-31 17:49:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:49:06,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:49:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:49:07,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:49:07,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:49:07,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:49:07,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:49:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:49:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:49:07,041 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states.