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-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:51:41,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:51:41,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:51:41,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:51:41,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:51:41,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:51:41,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:51:41,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:51:41,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:51:41,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:51:41,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:51:41,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:51:41,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:51:41,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:51:41,325 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:51:41,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:51:41,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:51:41,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:51:41,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:51:41,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:51:41,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:51:41,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:51:41,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:51:41,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:51:41,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:51:41,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:51:41,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:51:41,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:51:41,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:51:41,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:51:41,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:51:41,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:51:41,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:51:41,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:51:41,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:51:41,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:51:41,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:51:41,357 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:51:41,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:51:41,358 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:51:41,359 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:51:41,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:51:41,359 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:51:41,359 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:51:41,359 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:51:41,360 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:51:41,360 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:51:41,360 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:51:41,360 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:51:41,360 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:51:41,361 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:51:41,361 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:51:41,361 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:51:41,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:51:41,362 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:51:41,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:51:41,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:51:41,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:51:41,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:51:41,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:51:41,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:51:41,366 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:51:41,366 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:51:41,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:51:41,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:51:41,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:51:41,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:51:41,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:41,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:51:41,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:51:41,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:51:41,368 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:51:41,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:51:41,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:51:41,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:51:41,369 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:51:41,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:51:41,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:51:41,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:51:41,418 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:51:41,418 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:51:41,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-02-25 15:51:41,419 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-25 15:51:41,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:51:41,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:51:41,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:41,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:51:41,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:51:41,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:41,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:51:41,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:51:41,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:51:41,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... [2019-02-25 15:51:41,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:51:41,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:51:41,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:51:41,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:51:41,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:51:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:51:41,914 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:51:41,914 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-25 15:51:41,916 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:41 BoogieIcfgContainer [2019-02-25 15:51:41,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:51:41,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:51:41,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:51:41,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:51:41,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:41" (1/2) ... [2019-02-25 15:51:41,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e68cb03 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:51:41, skipping insertion in model container [2019-02-25 15:51:41,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:41" (2/2) ... [2019-02-25 15:51:41,923 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-25 15:51:41,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:51:41,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-25 15:51:41,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-25 15:51:41,987 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:51:41,988 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:51:41,988 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:51:41,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:51:41,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:51:41,988 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:51:41,988 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:51:41,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:51:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-25 15:51:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:51:42,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:42,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:51:42,013 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-25 15:51:42,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:42,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:42,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:42,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:42,215 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-25 15:51:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:42,494 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-25 15:51:42,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:42,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:51:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:42,516 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:51:42,516 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:51:42,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:51:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-25 15:51:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:51:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-25 15:51:42,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-25 15:51:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:42,555 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-25 15:51:42,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-25 15:51:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:42,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:42,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:42,556 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-25 15:51:42,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:42,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:42,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:42,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:42,713 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-25 15:51:42,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:42,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:43,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:43,760 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:43,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:43,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:43,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:43,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:43,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:43,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:43,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:44,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:44,105 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,201 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,286 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,458 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,526 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:44,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:51:44,559 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:51:44,573 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:51:44,616 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:51:44,617 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,689 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,801 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,851 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,862 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:44,945 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:44,946 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:51:45,167 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-02-25 15:51:45,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:45,218 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:45,220 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,256 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:45,256 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:45,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:45,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:45,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:45,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:45,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:45,404 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-25 15:51:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:45,929 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-25 15:51:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:45,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:51:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:45,932 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:51:45,932 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:51:45,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:51:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:51:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-25 15:51:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:51:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-25 15:51:45,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-25 15:51:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:45,938 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-25 15:51:45,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-25 15:51:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:45,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:45,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:45,940 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:45,940 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-25 15:51:45,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:45,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:45,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:45,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:46,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:46,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:46,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:46,054 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-25 15:51:46,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:46,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:48,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:48,650 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-02-25 15:51:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:48,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:48,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:48,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:48,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:48,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:48,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:48,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:48,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:48,844 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,861 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,868 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,882 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:48,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:51:48,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:51:48,934 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:51:48,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:51:48,956 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,976 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,992 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,004 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,015 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,041 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:49,041 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:51:49,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,161 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:51:49,167 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:51:49,439 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:51:49,439 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-02-25 15:51:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:49,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:51:49,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:49,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:49,556 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-25 15:51:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:49,607 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-25 15:51:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:49,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:51:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:49,612 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:51:49,612 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:51:49,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:51:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:51:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:51:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-25 15:51:49,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-25 15:51:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:49,617 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-25 15:51:49,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-25 15:51:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:49,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:49,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:49,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:49,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-25 15:51:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:49,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:49,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:49,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:49,660 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-25 15:51:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:49,703 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-25 15:51:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:49,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:51:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:49,704 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:51:49,704 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:51:49,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:51:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-25 15:51:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:51:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-25 15:51:49,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-25 15:51:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:49,709 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-25 15:51:49,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-25 15:51:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:49,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:49,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:49,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-25 15:51:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:49,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:49,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:49,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:49,780 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-25 15:51:49,784 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:49,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:50,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:50,062 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:50,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:50,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:50,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:50,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:50,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:50,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:50,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:50,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:51:50,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,209 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:51:50,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:51:50,308 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:51:50,309 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,330 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,386 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,404 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,416 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,448 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:50,449 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,455 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,461 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,472 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,496 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:50,496 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:51:50,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,567 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:50,568 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,587 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:50,588 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:50,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:50,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:50,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:50,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:50,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:50,660 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-25 15:51:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:50,818 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-25 15:51:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:50,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:51:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:50,822 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:51:50,822 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:51:50,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:51:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:51:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-25 15:51:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:51:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-25 15:51:50,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-25 15:51:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:50,827 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-25 15:51:50,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-25 15:51:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:50,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:50,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:50,828 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-25 15:51:50,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:50,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:50,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:50,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:50,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:50,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:50,927 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-25 15:51:50,931 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:50,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:51,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:51,316 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:51,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:51,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:51,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:51,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:51,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:51,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:51:51,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:51,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:51,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:51:51,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:51:51,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,421 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:51:51,438 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:51:51,439 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,459 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,476 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,489 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,501 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:51,534 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,542 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,549 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,560 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,582 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:51,582 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:51:51,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:51:51,623 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:51:51,689 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:51:51,690 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-25 15:51:51,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:51,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:51:51,772 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:51:52,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,030 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:51:52,031 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 15:51:52,031 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,205 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:51:52,205 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-25 15:51:56,318 WARN L181 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-02-25 15:51:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:56,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:56,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:56,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:56,379 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-25 15:51:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:56,894 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-25 15:51:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:51:56,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:56,896 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:51:56,896 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:51:56,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:51:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:51:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-25 15:51:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:51:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-25 15:51:56,904 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-25 15:51:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-25 15:51:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-25 15:51:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:56,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:56,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:56,905 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-25 15:51:56,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:56,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:56,953 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-25 15:51:56,954 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:56,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:57,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:57,182 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:57,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:57,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:57,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:51:57,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:57,231 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:57,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:51:57,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,251 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:51:57,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:51:57,296 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:51:57,296 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,316 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,332 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,347 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,357 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:57,391 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,397 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,406 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,429 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:57,429 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:51:57,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,462 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-25 15:51:57,463 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,482 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:57,483 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-25 15:51:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:57,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:57,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:57,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-25 15:51:57,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:57,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:57,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:57,536 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-25 15:51:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:57,646 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-25 15:51:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:57,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:51:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:57,648 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:51:57,648 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:51:57,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:51:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-25 15:51:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:51:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-25 15:51:57,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-25 15:51:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:57,661 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-25 15:51:57,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-25 15:51:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:57,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:57,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:57,662 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-25 15:51:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:57,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:57,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:57,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:57,835 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-25 15:51:57,836 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:57,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:58,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:58,145 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:58,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:58,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:58,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:58,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:58,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:58,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:51:58,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:58,200 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:51:58,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,242 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:51:58,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:51:58,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,386 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:51:58,490 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:51:58,492 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,735 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,770 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,785 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,800 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:58,838 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,852 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,864 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,881 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,909 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:58,910 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:51:58,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:58,970 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:58,970 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,992 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:58,993 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:59,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,030 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:51:59,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:59,031 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,049 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:59,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2019-02-25 15:51:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:59,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:59,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:59,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:59,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:59,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:59,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:59,109 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-25 15:51:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:59,583 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-25 15:51:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:51:59,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:59,585 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:51:59,586 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:51:59,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:51:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-25 15:51:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:51:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-25 15:51:59,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-25 15:51:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:59,594 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-25 15:51:59,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-25 15:51:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:59,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:59,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:59,595 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-25 15:51:59,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:59,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:59,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:59,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:59,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:59,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:59,664 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-25 15:51:59,665 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:59,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:59,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:59,922 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:59,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:59,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:59,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:59,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:59,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:51:59,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:59,992 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:51:59,993 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,012 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,028 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,057 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:00,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:52:00,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:00,082 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:00,091 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:00,092 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,109 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,123 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,134 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,144 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,166 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:00,166 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:00,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:00,207 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,223 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:00,224 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:00,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,253 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:00,254 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,270 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:00,271 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:00,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:00,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:00,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:00,331 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-25 15:52:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:00,656 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-25 15:52:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:00,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:00,658 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:52:00,658 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:52:00,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:52:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-25 15:52:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:52:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-25 15:52:00,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-25 15:52:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:00,667 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-25 15:52:00,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-25 15:52:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:00,668 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:00,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:00,668 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-25 15:52:00,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:00,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:00,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:00,702 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-25 15:52:00,704 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:00,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:02,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:02,189 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:02,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:02,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:02,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:02,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:02,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:02,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:02,220 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:02,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,236 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:02,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:02,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:02,267 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,327 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,342 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,354 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,365 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:02,399 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,406 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,416 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,433 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,460 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:02,461 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:02,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:02,517 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,578 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:02,578 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:02,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:02,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:02,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:02,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:02,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:02,627 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-25 15:52:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:02,771 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-25 15:52:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:02,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:52:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:02,773 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:52:02,773 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:52:02,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:52:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:52:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-25 15:52:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:52:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-25 15:52:02,781 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-25 15:52:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:02,782 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-25 15:52:02,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-25 15:52:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:02,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:02,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:02,783 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-25 15:52:02,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:02,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:02,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:02,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:02,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:02,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:02,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:02,865 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-25 15:52:02,867 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:02,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:03,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:03,403 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-02-25 15:52:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:03,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:03,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:03,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:03,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:03,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:03,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:03,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:03,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:03,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,441 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:03,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:03,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:03,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:03,501 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,528 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,545 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,558 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,568 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,609 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:03,609 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,618 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,626 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,642 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,660 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,691 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:03,692 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:03,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,720 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:03,721 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,754 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:03,754 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:03,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:03,821 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,859 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:03,859 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:52:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:03,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:03,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:03,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:03,978 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-25 15:52:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:04,402 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-25 15:52:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:04,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:04,404 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:52:04,404 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:52:04,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:52:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-25 15:52:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:52:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-25 15:52:04,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-25 15:52:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:04,414 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-25 15:52:04,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-25 15:52:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:04,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:04,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:04,415 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-25 15:52:04,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:04,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:04,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:04,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:04,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:04,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:04,550 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-25 15:52:04,551 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:04,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:04,802 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:04,802 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:04,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:04,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:04,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:04,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:04,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:04,818 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:04,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:04,855 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:04,856 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,868 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,877 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,888 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:04,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:52:04,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:04,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:04,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:04,943 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,966 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,980 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,991 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,001 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,022 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,022 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:05,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:05,054 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,071 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:05,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:05,099 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,117 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,117 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:05,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:05,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:05,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:05,169 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-25 15:52:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:05,454 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-25 15:52:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:05,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:05,456 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:52:05,456 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:52:05,457 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-02-25 15:52:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:52:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-25 15:52:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:52:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-25 15:52:05,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-25 15:52:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:05,466 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-25 15:52:05,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-25 15:52:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:05,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:05,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:05,467 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-25 15:52:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:05,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:05,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:52:05,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:05,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:05,531 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-25 15:52:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:05,637 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-25 15:52:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:05,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:52:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:05,638 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:52:05,638 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:52:05,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:52:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-25 15:52:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:52:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-25 15:52:05,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-25 15:52:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:05,647 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-25 15:52:05,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-25 15:52:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:05,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:05,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:05,648 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-25 15:52:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:05,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:05,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:05,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:05,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:05,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:52:05,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:05,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:05,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:05,775 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:05,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:05,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,792 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:05,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:05,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,812 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:05,812 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,841 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,857 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,868 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,878 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:05,926 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,936 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,947 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,960 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,978 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,008 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,008 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:06,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,034 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:06,034 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,063 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:06,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,114 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:06,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:06,116 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,145 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,145 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:52:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:06,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:06,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:06,204 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-25 15:52:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:06,606 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-25 15:52:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:06,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:06,608 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:52:06,608 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:52:06,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:52:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-25 15:52:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:52:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-25 15:52:06,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-25 15:52:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:06,620 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-25 15:52:06,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-25 15:52:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:06,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:06,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:06,621 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-25 15:52:06,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:06,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:06,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:06,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:06,668 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-25 15:52:06,670 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:06,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:06,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:06,869 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:06,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:06,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:06,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:06,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:06,898 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:06,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:06,932 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:06,933 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,945 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,953 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,966 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:06,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2019-02-25 15:52:06,989 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:06,992 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:06,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:06,998 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,014 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,028 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,039 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,049 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,071 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,071 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:07,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:07,124 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,141 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,141 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:07,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,163 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:07,163 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,183 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:07,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:07,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:07,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:07,238 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-25 15:52:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:07,552 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-25 15:52:07,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:07,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:07,553 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:52:07,554 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:52:07,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:52:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-25 15:52:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:52:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-25 15:52:07,566 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-25 15:52:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:07,566 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-25 15:52:07,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-25 15:52:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:07,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:07,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:07,567 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-25 15:52:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:07,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:07,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:07,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:07,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:07,648 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-25 15:52:07,653 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:07,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:07,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:07,800 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:07,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:07,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:07,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:07,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:07,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:07,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:07,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:07,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:07,884 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:07,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:07,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:07,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:07,947 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,011 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,025 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,034 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,046 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:08,122 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,130 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,143 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,161 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:08,190 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:08,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:08,217 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:08,218 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,246 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:08,246 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:08,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:08,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:08,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:08,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:08,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:08,294 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-25 15:52:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:08,769 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-25 15:52:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:08,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:52:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:08,771 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:52:08,771 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:52:08,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:52:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:52:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-25 15:52:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:52:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-25 15:52:08,783 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-25 15:52:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:08,783 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-25 15:52:08,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-25 15:52:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:08,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:08,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:08,785 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-25 15:52:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:08,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:08,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:08,841 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-25 15:52:08,843 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:08,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:09,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:09,156 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:09,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:09,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:09,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:09,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:09,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:09,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:09,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:09,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:09,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,236 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:09,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,251 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:09,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:09,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,280 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:09,280 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,314 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,332 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,346 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,358 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,455 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:09,456 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,536 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,542 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,555 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,575 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,611 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,611 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:09,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,698 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:09,698 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,750 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,750 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:09,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:09,795 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,825 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,826 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:52:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:09,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:09,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:09,894 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-25 15:52:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:10,230 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-25 15:52:10,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:10,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:10,231 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:52:10,231 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:52:10,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:52:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-25 15:52:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:52:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-25 15:52:10,242 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-25 15:52:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-25 15:52:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-25 15:52:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:10,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:10,244 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:52:10,244 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-25 15:52:10,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:10,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:10,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:10,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:10,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:10,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:10,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:10,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:10,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:10,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:10,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:10,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:10,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,381 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:10,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,386 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:10,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,394 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:10,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:10,410 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,445 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,459 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,470 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,482 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:10,535 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,543 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,554 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,567 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,585 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,616 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,617 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:10,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,665 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:10,665 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,726 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,727 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:10,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:52:10,785 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,815 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,815 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-25 15:52:10,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:10,842 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,872 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,872 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:10,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:10,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:10,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-25 15:52:10,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:10,929 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-25 15:52:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:11,251 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-25 15:52:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:11,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:52:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:11,252 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:52:11,253 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:52:11,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:52:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-25 15:52:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:52:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-25 15:52:11,266 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-25 15:52:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:11,266 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-25 15:52:11,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-25 15:52:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:11,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:11,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:11,268 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-25 15:52:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:11,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:11,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:11,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:11,405 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-25 15:52:11,406 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:11,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:11,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:11,638 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:11,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:11,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:11,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:11,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:11,676 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:11,696 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:11,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:11,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:11,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,727 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:11,728 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,754 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,767 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,776 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,787 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,823 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:11,824 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,833 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,843 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,860 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,886 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,887 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:11,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:11,928 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,955 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,955 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:12,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,101 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 64 [2019-02-25 15:52:12,101 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,185 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:12,185 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-25 15:52:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:12,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:12,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:12,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:12,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:12,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:12,242 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-25 15:52:12,690 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-25 15:52:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:12,895 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-25 15:52:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:12,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:12,897 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:52:12,897 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:52:12,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-02-25 15:52:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:52:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-25 15:52:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:52:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-25 15:52:12,914 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-25 15:52:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:12,915 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-25 15:52:12,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-25 15:52:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:12,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:12,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:12,917 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-25 15:52:12,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:12,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:12,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:13,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-02-25 15:52:13,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:13,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:13,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:13,040 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-25 15:52:13,042 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:13,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:13,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:13,330 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:13,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:13,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:13,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:13,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:13,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:13,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:13,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:13,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:13,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:13,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:13,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:13,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:13,391 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:13,392 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,422 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,437 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,448 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,459 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,491 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:13,491 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,497 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,502 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,513 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,534 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:13,535 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:13,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,707 INFO L292 Elim1Store]: Index analysis took 148 ms [2019-02-25 15:52:13,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:52:13,847 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:14,856 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:14,857 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-25 15:52:15,217 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-25 15:52:15,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,325 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:52:15,327 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:52:15,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,506 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:15,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 15:52:15,507 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,593 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:52:15,593 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-25 15:52:15,874 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-25 15:52:15,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,885 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:15,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:52:15,886 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-25 15:52:15,971 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,050 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:16,051 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:16,051 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,158 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:16,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:16,159 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,226 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:52:16,226 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-25 15:52:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:16,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:16,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:16,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:16,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:16,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:16,419 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-25 15:52:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:17,310 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-25 15:52:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:52:17,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:17,313 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:52:17,313 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:52:17,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:52:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:52:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-25 15:52:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:52:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-25 15:52:17,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-25 15:52:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:17,331 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-25 15:52:17,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-25 15:52:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:17,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:17,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:17,332 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:17,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,332 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-25 15:52:17,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:17,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:17,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:17,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:17,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:17,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:17,428 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-25 15:52:17,430 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:17,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:17,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:17,656 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:17,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:17,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:17,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:17,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:17,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:17,675 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:17,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:17,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:17,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:17,723 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:17,723 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,745 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,759 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,770 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,779 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,811 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:17,811 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,816 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,822 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,833 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,855 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,855 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:17,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:17,894 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,910 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:17,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,936 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:17,936 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,982 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,983 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:17,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:18,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:18,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:18,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:18,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:18,037 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-25 15:52:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:18,389 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-25 15:52:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:18,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:18,391 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:52:18,391 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:52:18,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:52:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-25 15:52:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:52:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-25 15:52:18,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-25 15:52:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:18,410 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-25 15:52:18,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-25 15:52:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:18,411 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:18,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:18,411 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-25 15:52:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:18,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:18,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:18,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:18,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:18,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:18,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:18,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:18,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:18,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:18,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:18,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:18,587 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,597 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,610 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,625 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,644 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,668 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:18,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:18,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:18,674 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:18,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:18,677 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,702 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,716 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,727 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,737 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,768 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:18,768 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:18,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:18,845 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,885 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:18,885 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:18,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,916 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:18,917 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:18,917 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,944 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:18,944 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2019-02-25 15:52:18,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:52:18,978 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:19,006 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:52:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:19,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:19,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:19,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:19,092 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-25 15:52:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:19,686 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-25 15:52:19,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:19,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:19,689 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:52:19,689 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:52:19,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:52:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-25 15:52:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:52:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-25 15:52:19,703 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-25 15:52:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:19,704 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-25 15:52:19,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-25 15:52:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:19,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:19,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:19,704 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-25 15:52:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:19,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:19,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:19,992 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-25 15:52:19,993 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:19,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:20,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:20,192 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:20,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:20,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:20,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:20,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:20,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:20,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:52:20,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:20,238 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:20,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:20,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,258 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:20,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:20,283 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:52:20,284 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,319 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,334 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,344 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,354 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:20,380 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,385 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,393 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,412 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,412 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:52:20,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:20,444 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,453 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,454 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:20,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:20,483 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,493 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,494 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-25 15:52:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:20,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:20,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:20,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:20,547 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-25 15:52:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:20,809 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-25 15:52:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:20,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:20,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:20,811 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:52:20,811 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:52:20,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:52:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-25 15:52:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:52:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-25 15:52:20,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-25 15:52:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:20,827 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-25 15:52:20,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-25 15:52:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:20,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:20,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:20,829 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-25 15:52:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:20,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:21,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:21,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:21,009 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-25 15:52:21,010 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:21,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:21,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:21,392 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:21,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:21,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:21,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:21,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:21,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:21,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:21,443 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,458 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,468 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,478 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:21,496 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:52:21,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:21,502 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:21,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:21,510 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,529 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,542 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,554 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,564 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,585 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,585 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:21,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:21,632 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,652 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,652 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:21,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:21,679 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,697 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,697 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:21,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,723 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:21,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:21,724 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,740 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,741 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:21,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:21,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:21,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:21,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:21,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:21,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:21,846 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-25 15:52:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:22,354 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-25 15:52:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:22,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:22,356 INFO L225 Difference]: With dead ends: 113 [2019-02-25 15:52:22,356 INFO L226 Difference]: Without dead ends: 112 [2019-02-25 15:52:22,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-25 15:52:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-25 15:52:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-25 15:52:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-25 15:52:22,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-25 15:52:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:22,376 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-25 15:52:22,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-25 15:52:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:22,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:22,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:22,376 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-25 15:52:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:22,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:22,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:22,668 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-25 15:52:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:22,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:22,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:22,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:22,696 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-25 15:52:22,699 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:22,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:22,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:22,995 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:22,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:22,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:22,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:23,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:23,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:23,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:23,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:23,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:23,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,034 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:23,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:23,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:23,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:23,097 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,118 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,133 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,146 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,156 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:23,188 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,193 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,202 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,213 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,234 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,235 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:23,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:23,315 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:52:23,484 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:52:23,484 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-02-25 15:52:23,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2019-02-25 15:52:23,580 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,646 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:23,647 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:23,647 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2019-02-25 15:52:23,708 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,765 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:23,765 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-02-25 15:52:23,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,996 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:23,996 INFO L292 Elim1Store]: Index analysis took 175 ms [2019-02-25 15:52:23,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:23,997 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:24,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-25 15:52:24,077 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:24,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,136 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:24,137 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:24,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:24,183 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-25 15:52:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:24,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:24,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:24,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:52:24,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:24,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:24,365 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-25 15:52:24,825 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-02-25 15:52:25,185 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-02-25 15:52:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:25,652 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-25 15:52:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:52:25,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:25,654 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:52:25,655 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:52:25,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:52:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-25 15:52:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:52:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-25 15:52:25,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-25 15:52:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:25,682 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-25 15:52:25,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-25 15:52:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:25,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:25,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:25,683 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-25 15:52:25,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:25,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:25,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:25,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:25,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:25,794 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-25 15:52:25,795 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:25,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:26,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:26,293 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:26,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:26,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:26,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:26,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:26,306 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:26,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:26,345 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:26,346 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,367 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,374 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,385 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,403 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:26,436 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:26,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:26,441 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:26,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:26,443 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,466 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,480 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,491 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,501 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,532 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:26,532 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:26,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:26,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,581 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:26,582 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:26,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,622 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:26,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:26,624 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:26,651 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:52:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:26,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:26,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:26,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:26,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:26,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:26,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:26,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:26,756 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-25 15:52:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:27,093 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-25 15:52:27,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:27,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:27,096 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:52:27,096 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:52:27,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:52:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-25 15:52:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:52:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-25 15:52:27,134 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-25 15:52:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:27,134 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-25 15:52:27,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-25 15:52:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:27,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:27,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:27,135 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-25 15:52:27,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:27,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:27,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:27,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:27,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:27,212 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-25 15:52:27,213 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:27,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:28,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:28,598 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-02-25 15:52:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:28,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:28,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:28,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:28,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:28,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:28,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:28,628 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:28,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:28,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:28,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:28,671 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,702 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,715 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,726 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,737 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,773 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:28,773 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,782 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,791 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,807 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,835 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,836 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:28,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:28,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,879 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,880 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:52:28,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:28,925 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-25 15:52:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:29,056 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-25 15:52:29,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:29,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:52:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:29,058 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:52:29,058 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:52:29,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:52:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-25 15:52:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:52:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-25 15:52:29,104 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-25 15:52:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:29,105 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-25 15:52:29,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-25 15:52:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:29,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:29,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:29,106 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-25 15:52:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:29,675 WARN L181 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-25 15:52:30,102 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-25 15:52:30,282 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:52:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:30,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:30,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:30,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:30,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:30,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:30,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:30,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:30,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:30,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:30,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:30,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:30,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:30,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:30,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:30,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:30,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:30,427 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:30,428 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,446 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,461 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,472 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,483 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,515 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:30,515 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,521 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,527 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,538 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:30,560 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:30,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:30,624 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:52:30,807 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-25 15:52:30,807 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-02-25 15:52:30,941 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-02-25 15:52:30,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:52:30,952 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,043 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:31,044 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:31,127 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,208 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:31,208 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,274 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 15:52:31,275 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-02-25 15:52:31,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,349 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:52:31,350 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-25 15:52:31,440 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,522 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:31,523 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,595 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:31,597 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,658 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:52:31,659 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-25 15:52:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:31,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:31,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:31,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:31,808 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-25 15:52:32,201 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-25 15:52:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:32,484 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-25 15:52:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:32,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:32,486 INFO L225 Difference]: With dead ends: 131 [2019-02-25 15:52:32,486 INFO L226 Difference]: Without dead ends: 130 [2019-02-25 15:52:32,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-25 15:52:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-25 15:52:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:52:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-25 15:52:32,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-25 15:52:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:32,508 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-25 15:52:32,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-25 15:52:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:32,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:32,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:32,508 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-25 15:52:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,677 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-25 15:52:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:32,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:32,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:32,692 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-25 15:52:32,693 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:32,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:33,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:33,195 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:33,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:33,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:33,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:33,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:33,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:33,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:33,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:33,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:33,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:33,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,306 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:33,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,329 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:33,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:33,339 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,366 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,379 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,390 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,401 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:33,437 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,446 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,458 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,474 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,502 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:33,503 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:33,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:33,528 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,554 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:33,555 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:33,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,578 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:33,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:33,580 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,603 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:33,603 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:52:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:33,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:33,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:33,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:33,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:33,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:33,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:33,665 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-25 15:52:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:34,155 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-25 15:52:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:34,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:34,157 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:52:34,157 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:52:34,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:52:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-25 15:52:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:52:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-25 15:52:34,181 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-25 15:52:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:34,181 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-25 15:52:34,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-25 15:52:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:34,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:34,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:34,182 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-25 15:52:34,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:34,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:34,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:34,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:34,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:34,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:34,263 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-25 15:52:34,265 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:34,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:34,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:34,474 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:34,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:34,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:34,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:34,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:34,507 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,537 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,554 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,568 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,591 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:34,593 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:52:34,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:34,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:34,615 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:34,616 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,649 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,673 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,690 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,719 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,744 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,744 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:34,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:34,783 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,808 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,809 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:34,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:34,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,882 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,883 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:34,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:34,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:34,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:34,955 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-25 15:52:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:35,226 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-25 15:52:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:35,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:35,228 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:52:35,228 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:52:35,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:52:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-25 15:52:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:52:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-25 15:52:35,253 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-25 15:52:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:35,253 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-25 15:52:35,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-25 15:52:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:35,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:35,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:35,254 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-25 15:52:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:35,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:35,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:35,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:35,359 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-25 15:52:35,361 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:35,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:35,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:35,561 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:35,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:35,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:35,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:35,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:35,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:35,578 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:35,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:35,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:35,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:35,618 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:35,618 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,648 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,664 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,676 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,687 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,718 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:35,718 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,723 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,759 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,769 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,791 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,791 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:35,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:35,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,845 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,845 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:35,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,869 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:35,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:35,870 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,888 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,888 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:35,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-25 15:52:35,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:35,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:35,949 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-25 15:52:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:36,174 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-25 15:52:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:36,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:52:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:36,176 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:52:36,176 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:52:36,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:52:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-25 15:52:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:52:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-25 15:52:36,203 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-25 15:52:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:36,204 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-25 15:52:36,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-25 15:52:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:36,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:36,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:36,205 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-25 15:52:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:52:36,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:36,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:36,426 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-25 15:52:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:36,517 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-25 15:52:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:36,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:52:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:36,518 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:52:36,518 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:52:36,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:52:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-25 15:52:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:52:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-25 15:52:36,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-25 15:52:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:36,550 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-25 15:52:36,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-25 15:52:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:36,550 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:36,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:36,551 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-25 15:52:36,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,734 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-25 15:52:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:36,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:36,869 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-25 15:52:36,870 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:36,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:37,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:37,095 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:37,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:37,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:37,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:37,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:52:37,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:37,126 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:37,126 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,138 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,155 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:37,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:37,183 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:37,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:37,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:52:37,202 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,217 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,229 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,239 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,249 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,268 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,269 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:52:37,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,301 INFO L467 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:37,302 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:37,352 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:37,353 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:58 [2019-02-25 15:52:37,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,384 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:37,385 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,398 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,398 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-25 15:52:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:37,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:37,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:37,443 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-25 15:52:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:37,692 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-25 15:52:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:37,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:37,694 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:52:37,694 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:52:37,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:52:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-25 15:52:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:52:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-25 15:52:37,739 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-25 15:52:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:37,739 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-25 15:52:37,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-25 15:52:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:37,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:37,740 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:37,740 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-25 15:52:37,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:37,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:37,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:37,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:37,815 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:37,815 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-25 15:52:37,816 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:37,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:37,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:37,947 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:37,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:37,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:37,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:52:37,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:37,979 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:37,980 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,992 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,006 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:38,031 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:38,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:38,046 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:38,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:52:38,054 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,070 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,083 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,093 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,102 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:38,122 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:52:38,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:38,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:38,157 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,166 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:38,166 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:38,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:38,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:38,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:38,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:38,184 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 15:52:38,184 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,195 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:38,195 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-25 15:52:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:38,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:38,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:38,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:38,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:38,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:38,250 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-25 15:52:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:38,593 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-25 15:52:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:38,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:38,594 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:52:38,594 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:52:38,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:52:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-25 15:52:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:52:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-25 15:52:38,652 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-25 15:52:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:38,653 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-25 15:52:38,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-25 15:52:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:38,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:38,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:38,654 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-25 15:52:38,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:38,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:38,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:38,718 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:38,719 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-25 15:52:38,719 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:38,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:38,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:38,986 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:39,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:39,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:39,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:39,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:39,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:39,055 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,076 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,088 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,101 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,119 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:39,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:39,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:39,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:39,153 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:39,153 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,177 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,191 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,203 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,212 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,243 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:39,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:39,276 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,304 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,304 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:39,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:39,340 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,368 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:39,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,400 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:39,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:39,402 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,426 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,427 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:52:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:39,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:39,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:39,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:39,504 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-25 15:52:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,098 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-25 15:52:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:40,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,100 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:52:40,100 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:52:40,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:52:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-25 15:52:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:52:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-25 15:52:40,171 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-25 15:52:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,172 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-25 15:52:40,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-25 15:52:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:40,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:40,173 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-25 15:52:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:40,335 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:52:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:40,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:40,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:40,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:40,735 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-25 15:52:40,736 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:40,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:41,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:41,010 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:41,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:41,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:41,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:41,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:41,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:41,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:41,060 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,078 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,092 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,113 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:41,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:41,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:41,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:41,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:41,149 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,171 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,184 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,194 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,204 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,232 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,232 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:41,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,281 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:41,281 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,297 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,297 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:41,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:41,327 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,406 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:41,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,429 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:41,430 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:41,431 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,448 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,449 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:41,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:41,520 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-25 15:52:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:41,990 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-25 15:52:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:41,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:41,992 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:52:41,993 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:52:41,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:52:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-25 15:52:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:52:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-25 15:52:42,088 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-25 15:52:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:42,088 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-25 15:52:42,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-25 15:52:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:42,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:42,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:42,089 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:42,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-25 15:52:42,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:42,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:42,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:42,160 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:42,160 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-25 15:52:42,162 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:42,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:42,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:42,445 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:42,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:42,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:42,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:42,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:42,492 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,507 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,518 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,529 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:42,550 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2019-02-25 15:52:42,564 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:42,566 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:42,571 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:42,572 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,590 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,604 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,614 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,624 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,645 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,646 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:42,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:42,692 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,709 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,709 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:42,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,734 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:42,735 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,753 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,753 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:42,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,779 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:42,780 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:42,780 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,797 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,797 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:42,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:42,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:42,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:42,869 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-25 15:52:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:43,461 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-25 15:52:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:43,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:43,463 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:52:43,463 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:52:43,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:52:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-25 15:52:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:52:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-25 15:52:43,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-25 15:52:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:43,568 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-25 15:52:43,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-25 15:52:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:43,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:43,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:43,569 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-25 15:52:43,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:43,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:43,674 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-25 15:52:43,676 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:43,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:43,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:43,899 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-02-25 15:52:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:43,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:43,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:43,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:43,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:43,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:43,917 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:43,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:43,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:43,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:43,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:43,960 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,996 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,010 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,021 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,031 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:44,073 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,098 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,109 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,125 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,153 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,154 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:44,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:44,187 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,205 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,205 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:44,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:44,234 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,251 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,251 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:44,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-02-25 15:52:44,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:44,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:44,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:44,312 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-25 15:52:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:44,699 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-25 15:52:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:44,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:44,701 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:52:44,702 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:52:44,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:52:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-25 15:52:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:52:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-25 15:52:44,809 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-25 15:52:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:44,809 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-25 15:52:44,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-25 15:52:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:44,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:44,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:44,810 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-25 15:52:44,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:44,968 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-02-25 15:52:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:44,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:44,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:44,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:44,996 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-25 15:52:44,997 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:44,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:45,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:45,582 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:45,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:45,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:45,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:45,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:45,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:45,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:45,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:45,618 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,631 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,646 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,663 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:45,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:52:45,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:45,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:45,699 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:45,699 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,716 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,730 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,740 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,750 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,771 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:45,771 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:45,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:45,835 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:52:46,004 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-25 15:52:46,005 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-02-25 15:52:46,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,180 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-02-25 15:52:46,180 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,278 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:46,278 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-02-25 15:52:46,279 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,347 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:46,348 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:52:46,348 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,397 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:46,398 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-02-25 15:52:46,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:46,453 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2019-02-25 15:52:46,514 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,571 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:46,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2019-02-25 15:52:46,573 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,633 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:46,634 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-25 15:52:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:46,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:46,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:46,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:46,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:46,758 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-25 15:52:46,900 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-02-25 15:52:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:47,875 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-25 15:52:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:47,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:47,877 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:52:47,877 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:52:47,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:52:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-25 15:52:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:52:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-25 15:52:47,991 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-25 15:52:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:47,991 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-25 15:52:47,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-25 15:52:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:47,992 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:47,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:47,992 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-25 15:52:47,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:48,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:48,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:48,070 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-25 15:52:48,071 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:48,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:48,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:48,706 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:48,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:48,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:48,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:48,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:48,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:48,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:48,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:48,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:48,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,746 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:48,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,758 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:48,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:48,770 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,804 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,818 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,829 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,839 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:48,880 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,891 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,900 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,912 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,930 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,986 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:48,987 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:49,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:49,017 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,045 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,045 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:49,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,126 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:49,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:49,127 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,155 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,155 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:52:49,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,184 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:49,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:49,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,213 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,214 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-25 15:52:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:49,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:49,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:52:49,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:49,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:49,301 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-25 15:52:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:49,942 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-25 15:52:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:49,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:52:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:49,943 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:52:49,943 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:52:49,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:52:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-25 15:52:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:52:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-25 15:52:50,064 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-25 15:52:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:50,064 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-25 15:52:50,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-25 15:52:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:50,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:50,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:50,065 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-25 15:52:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:50,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:50,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:50,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:50,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:50,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:50,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:50,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:50,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:50,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:50,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:50,248 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:50,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,254 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:52:50,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:50,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,269 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:50,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:52:50,284 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,310 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,325 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,338 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,347 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:50,389 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,399 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,408 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,423 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,440 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,471 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:50,471 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-25 15:52:50,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:50,493 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,520 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:50,520 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:50,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:50,546 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,575 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:50,575 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:52:50,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:50,600 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:50,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:50,601 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,631 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:50,631 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:52:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:50,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:50,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:50,693 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-25 15:52:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:51,272 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-25 15:52:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:51,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:51,274 INFO L225 Difference]: With dead ends: 164 [2019-02-25 15:52:51,274 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:52:51,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:52:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-25 15:52:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:52:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-25 15:52:51,496 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-25 15:52:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:51,496 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-25 15:52:51,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-25 15:52:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:51,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:51,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:51,497 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-25 15:52:51,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:51,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:51,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:51,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:51,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:51,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:51,597 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-25 15:52:51,599 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:51,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:52,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:52,102 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-02-25 15:52:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:52,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:52,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:52,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:52,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:52,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:52,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:52,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:52,151 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,185 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,199 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,213 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:52,237 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:52,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:52,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:52,246 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:52,246 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,268 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,280 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,290 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,300 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,328 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:52,329 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:52,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:52,351 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,376 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:52,377 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:52,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:52,410 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:52,490 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:52,491 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 [2019-02-25 15:52:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:52,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:52,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:52,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:52,561 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-25 15:52:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:53,055 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-25 15:52:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:53,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:53,058 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:52:53,058 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:52:53,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:52:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-25 15:52:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-25 15:52:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-25 15:52:53,303 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-25 15:52:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:53,303 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-25 15:52:53,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-25 15:52:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:53,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:53,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:53,304 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-25 15:52:53,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:53,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:53,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:53,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:53,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:53,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:53,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:53,394 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-25 15:52:53,395 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:53,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:53,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:53,614 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-02-25 15:52:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:53,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:53,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:53,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:53,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:53,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:52:53,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:53,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:53,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:53,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:53,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:53,682 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:52:53,682 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,702 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,716 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,725 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,736 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,760 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:53,760 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,766 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,775 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,794 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:53,794 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:52:53,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,824 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:53,825 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,833 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:53,834 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:53,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:53,853 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,863 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:53,864 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-25 15:52:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:53,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:53,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:53,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:53,914 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-25 15:52:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:54,448 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-25 15:52:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:54,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:54,451 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:52:54,451 INFO L226 Difference]: Without dead ends: 174 [2019-02-25 15:52:54,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-25 15:52:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-25 15:52:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-25 15:52:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-25 15:52:54,842 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-25 15:52:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:54,842 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-25 15:52:54,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-25 15:52:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:54,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:54,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:54,843 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-25 15:52:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:54,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:52:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:52:54,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:54,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:52:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:52:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:52:54,936 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-25 15:52:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:55,310 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-25 15:52:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:55,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-25 15:52:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:55,313 INFO L225 Difference]: With dead ends: 185 [2019-02-25 15:52:55,313 INFO L226 Difference]: Without dead ends: 184 [2019-02-25 15:52:55,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:52:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-25 15:52:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-25 15:52:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-25 15:52:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-25 15:52:55,561 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-25 15:52:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:55,561 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-25 15:52:55,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:52:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-25 15:52:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:55,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:55,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:55,562 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-25 15:52:55,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:55,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:55,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:55,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:55,633 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-25 15:52:55,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:55,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:55,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:55,823 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-02-25 15:52:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:55,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:55,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:55,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:55,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:55,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:55,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:52:55,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:55,855 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:55,855 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,864 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,881 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:55,902 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:55,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:55,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:55,922 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:52:55,922 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,937 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,950 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,960 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,969 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:55,988 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:55,989 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:52:56,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:56,018 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,028 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:56,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,045 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:56,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:56,045 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,056 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,056 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-25 15:52:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:56,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:56,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:56,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:56,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:56,107 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-25 15:52:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:56,578 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-25 15:52:56,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:56,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:56,581 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:52:56,581 INFO L226 Difference]: Without dead ends: 141 [2019-02-25 15:52:56,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-25 15:52:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-25 15:52:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-25 15:52:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-25 15:52:56,832 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-25 15:52:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:56,832 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-25 15:52:56,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-25 15:52:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:56,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:56,833 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:56,833 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-25 15:52:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:56,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:56,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:56,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:56,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:56,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:56,997 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-25 15:52:56,997 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:56,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:57,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:57,582 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:57,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:57,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:57,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:57,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:57,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:57,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:57,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:57,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:52:57,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,676 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:52:57,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:52:57,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:52:57,707 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,733 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,746 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,757 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,768 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:57,804 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,812 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,823 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,839 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:57,867 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:57,867 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:52:57,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:57,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:57,897 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:57,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:57,987 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 15:52:58,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,025 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:58,025 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,045 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,046 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-25 15:52:58,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,068 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:58,073 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,089 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,090 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-25 15:52:58,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:58,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:58,149 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-25 15:52:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:58,871 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-25 15:52:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:58,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:52:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:58,874 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:52:58,874 INFO L226 Difference]: Without dead ends: 216 [2019-02-25 15:52:58,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-25 15:52:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-25 15:52:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-25 15:52:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-25 15:52:59,197 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-25 15:52:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:59,197 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-25 15:52:59,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-25 15:52:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:59,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:59,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:59,198 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-25 15:52:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:59,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:59,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:59,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:59,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:59,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:59,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:59,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:59,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:59,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:59,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:59,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:59,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:59,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:59,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:59,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:59,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:59,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:52:59,313 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,319 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,327 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,338 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:52:59,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2019-02-25 15:52:59,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:52:59,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:52:59,366 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:52:59,366 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,383 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,397 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,408 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,418 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,439 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:59,439 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-25 15:52:59,467 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,475 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:52:59,476 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:59,541 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:59,542 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-25 15:52:59,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,629 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 60 [2019-02-25 15:52:59,630 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:59,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-25 15:52:59,726 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,782 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:59,782 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-25 15:52:59,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,844 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:59,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 68 [2019-02-25 15:52:59,861 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-25 15:52:59,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:59,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,003 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:00,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:53:00,004 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:00,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:53:00,116 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:00,228 INFO L301 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-25 15:53:00,228 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-25 15:53:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:00,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:00,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:00,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:00,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:00,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:00,493 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-25 15:53:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:01,663 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-25 15:53:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:01,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:53:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:01,666 INFO L225 Difference]: With dead ends: 218 [2019-02-25 15:53:01,666 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:53:01,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:53:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:53:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-25 15:53:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:53:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-25 15:53:02,009 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-25 15:53:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:02,009 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-25 15:53:02,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-25 15:53:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:02,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:02,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:02,010 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-25 15:53:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:02,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:02,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:02,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:02,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:02,069 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:02,069 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-25 15:53:02,070 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:02,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:02,263 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:02,263 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-02-25 15:53:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:02,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:02,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:02,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:02,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:02,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:02,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:02,339 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,352 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,364 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,382 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,404 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:02,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:53:02,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:53:02,416 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:53:02,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:53:02,420 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,445 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,459 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,471 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,482 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,516 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,517 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:53:02,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,567 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:02,568 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,624 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,624 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:02,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:02,650 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,676 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,677 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-25 15:53:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:02,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:02,729 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-25 15:53:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:03,548 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-25 15:53:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:03,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:53:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:03,550 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:53:03,550 INFO L226 Difference]: Without dead ends: 269 [2019-02-25 15:53:03,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-25 15:53:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-25 15:53:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:53:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-25 15:53:04,048 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-25 15:53:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:04,048 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-25 15:53:04,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-25 15:53:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:04,049 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:04,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:04,049 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-25 15:53:04,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:04,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:04,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:04,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:04,190 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-25 15:53:04,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:04,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:05,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:05,274 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:05,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:05,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:05,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:05,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:05,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:05,291 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:05,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:05,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:05,303 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:53:05,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:53:05,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,325 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:53:05,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,345 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:53:05,345 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,381 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,401 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,413 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,427 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,473 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:05,473 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,506 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,522 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,546 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,582 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:05,582 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:53:05,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,608 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:05,608 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,635 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:05,635 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:05,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,669 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:05,670 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:05,751 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:05,752 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:53:05,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,806 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:05,807 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:05,807 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,828 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:05,829 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-25 15:53:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:05,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:53:05,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:53:05,883 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-25 15:53:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:07,429 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-25 15:53:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:53:07,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:53:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:07,434 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:53:07,434 INFO L226 Difference]: Without dead ends: 477 [2019-02-25 15:53:07,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:53:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-25 15:53:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-25 15:53:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-25 15:53:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-25 15:53:08,332 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-25 15:53:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:08,332 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-25 15:53:08,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-25 15:53:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:08,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:08,334 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:53:08,334 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-25 15:53:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:08,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:08,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:08,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:08,433 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-25 15:53:08,434 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:08,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:08,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:08,574 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:08,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:08,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:08,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:08,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:08,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:08,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:53:08,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:08,593 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:08,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-02-25 15:53:08,609 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:53:08,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:53:08,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:53:08,646 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,656 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,666 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,676 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,685 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,695 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:08,695 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-25 15:53:08,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:53:08,701 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,702 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,702 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:53:08,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-25 15:53:08,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,710 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,710 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-25 15:53:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:53:08,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-25 15:53:08,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:08,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:53:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:53:08,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:08,739 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-25 15:53:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:10,681 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-25 15:53:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:10,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-25 15:53:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:10,688 INFO L225 Difference]: With dead ends: 804 [2019-02-25 15:53:10,688 INFO L226 Difference]: Without dead ends: 800 [2019-02-25 15:53:10,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-25 15:53:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-25 15:53:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-25 15:53:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-25 15:53:12,773 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-25 15:53:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:12,773 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-25 15:53:12,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:53:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-25 15:53:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:12,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:12,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:12,777 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-25 15:53:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:12,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:12,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:12,928 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-25 15:53:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:12,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:12,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:12,975 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-25 15:53:12,976 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:12,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:13,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:13,298 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-02-25 15:53:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:13,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:13,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:13,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:13,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:13,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:53:13,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:13,319 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:13,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,323 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:53:13,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,338 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:53:13,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:53:13,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:53:13,363 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,399 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,415 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,428 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,436 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,488 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:13,488 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,497 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,508 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,525 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,543 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,573 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,573 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:53:13,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,612 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:13,613 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,642 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:13,642 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:13,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:13,682 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,710 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:13,710 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:53:13,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,746 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:13,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:13,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,774 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:13,775 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:53:13,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,829 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:13,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:13,830 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,857 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:13,857 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:53:15,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-02-25 15:53:15,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:15,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:15,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:53:15,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:15,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:53:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:53:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=178, Unknown=1, NotChecked=0, Total=272 [2019-02-25 15:53:15,976 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-25 15:53:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:18,630 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-25 15:53:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:18,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:53:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:18,637 INFO L225 Difference]: With dead ends: 821 [2019-02-25 15:53:18,637 INFO L226 Difference]: Without dead ends: 820 [2019-02-25 15:53:18,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=274, Unknown=1, NotChecked=0, Total=420 [2019-02-25 15:53:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-25 15:53:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-25 15:53:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-25 15:53:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-25 15:53:20,638 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-25 15:53:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:20,638 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-25 15:53:20,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:53:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-25 15:53:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:20,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:20,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:20,641 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-25 15:53:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:20,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:20,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:20,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:20,754 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-25 15:53:20,754 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:20,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:20,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:20,984 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-02-25 15:53:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:20,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:20,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:20,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:20,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:20,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:20,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:53:20,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:21,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:53:21,011 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,025 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:21,050 INFO L467 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 21 treesize of output 23 [2019-02-25 15:53:21,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:53:21,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:53:21,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-25 15:53:21,083 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,096 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,106 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,115 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,125 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,142 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:21,143 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-25 15:53:21,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:21,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:53:21,166 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,172 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,172 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:53:21,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:21,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:21,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:21,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:53:21,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,191 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:21,191 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-25 15:53:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:21,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:21,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:21,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:21,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:21,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:21,242 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-25 15:53:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:23,368 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-25 15:53:23,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:23,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:53:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:23,374 INFO L225 Difference]: With dead ends: 805 [2019-02-25 15:53:23,374 INFO L226 Difference]: Without dead ends: 804 [2019-02-25 15:53:23,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-02-25 15:53:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-25 15:53:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-25 15:53:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-25 15:53:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-25 15:53:25,425 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-25 15:53:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:25,425 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-25 15:53:25,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-25 15:53:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:25,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:25,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:25,427 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-25 15:53:25,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:25,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:25,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:25,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:25,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:25,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:25,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:25,544 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-25 15:53:25,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:25,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:25,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:25,847 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-02-25 15:53:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:25,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:25,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:25,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:25,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:25,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:25,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:25,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:25,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:25,870 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:53:25,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:53:25,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:53:25,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:25,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:53:25,907 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:25,940 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:25,962 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:25,974 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:25,987 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:26,031 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,045 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,057 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,076 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,111 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:26,112 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:53:26,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:53:26,156 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,173 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:26,174 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:53:26,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:26,199 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:26,216 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:53:26,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:26,241 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:26,242 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:26,242 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:26,259 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:26,260 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:53:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:26,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:26,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:26,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:53:26,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:26,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:26,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:26,356 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-25 15:53:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:29,210 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-25 15:53:29,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:29,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:53:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:29,220 INFO L225 Difference]: With dead ends: 1004 [2019-02-25 15:53:29,221 INFO L226 Difference]: Without dead ends: 1003 [2019-02-25 15:53:29,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-25 15:53:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-25 15:53:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-25 15:53:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-25 15:53:31,458 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-25 15:53:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:31,458 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-25 15:53:31,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-25 15:53:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:31,460 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:31,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:31,461 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-25 15:53:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:31,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:31,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:31,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:31,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:31,571 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-25 15:53:31,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:31,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:31,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:31,769 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-02-25 15:53:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:31,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:31,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:31,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:31,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:53:31,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:31,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:53:31,801 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,813 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,826 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:31,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:53:31,852 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:53:31,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:53:31,870 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:53:31,871 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,887 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,900 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,910 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,920 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,939 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:31,939 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-25 15:53:31,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,968 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-25 15:53:31,968 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,984 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:31,984 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-25 15:53:32,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:32,016 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:32,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:32,065 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-25 15:53:34,103 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-02-25 15:53:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:34,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:53:34,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:34,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:53:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:53:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:34,139 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-25 15:53:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:37,416 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-25 15:53:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:37,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:53:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:37,425 INFO L225 Difference]: With dead ends: 1213 [2019-02-25 15:53:37,425 INFO L226 Difference]: Without dead ends: 1212 [2019-02-25 15:53:37,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-25 15:53:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-25 15:53:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-25 15:53:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-25 15:53:40,365 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-25 15:53:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:40,365 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-25 15:53:40,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:53:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-25 15:53:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:40,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:40,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:40,368 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-25 15:53:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:40,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:40,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:40,556 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-25 15:53:40,557 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:40,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:40,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:40,884 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-02-25 15:53:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:40,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:40,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:53:40,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:40,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:40,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,917 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:53:40,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:53:40,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:53:40,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,956 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:53:40,956 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,984 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,999 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,009 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,021 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:41,077 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,094 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,104 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,129 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,155 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,191 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,191 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:53:41,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,230 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:41,230 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,266 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,266 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:41,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,304 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:41,304 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:41,305 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,342 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,342 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2019-02-25 15:53:41,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:53:41,400 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,436 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,436 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-25 15:53:41,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,483 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:41,483 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:53:41,484 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,514 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,514 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:53:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:41,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:41,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:53:41,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:41,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:53:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:53:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:41,601 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-25 15:53:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:47,993 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-25 15:53:47,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:53:47,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:53:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:48,009 INFO L225 Difference]: With dead ends: 1577 [2019-02-25 15:53:48,009 INFO L226 Difference]: Without dead ends: 1575 [2019-02-25 15:53:48,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:53:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-25 15:53:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-25 15:53:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-25 15:53:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-25 15:53:50,138 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-25 15:53:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:50,138 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-25 15:53:50,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:53:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-25 15:53:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:50,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:50,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:50,140 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-25 15:53:50,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:50,300 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:53:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:50,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:50,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:50,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:50,446 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-25 15:53:50,447 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:50,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:50,752 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:50,752 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-02-25 15:53:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:50,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:50,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:50,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:50,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:50,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:50,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:53:50,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:50,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:50,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:53:50,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:53:50,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:53:50,844 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:53:50,844 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,863 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,878 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,891 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,901 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,932 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:53:50,933 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,940 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,947 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,958 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,979 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:50,980 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:53:51,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:53:51,026 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,042 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:51,042 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:53:51,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,064 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:51,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:51,065 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,083 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:51,083 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 [2019-02-25 15:53:51,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,108 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:53:51,108 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,126 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:51,126 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:53:51,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,151 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:51,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:53:51,152 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,170 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:51,171 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:53:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:51,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:51,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:53:51,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:51,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:53:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:53:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:53:51,258 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-25 15:53:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:54,772 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-25 15:53:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:53:54,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:53:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:54,779 INFO L225 Difference]: With dead ends: 1108 [2019-02-25 15:53:54,779 INFO L226 Difference]: Without dead ends: 1107 [2019-02-25 15:53:54,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:53:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-25 15:53:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-25 15:53:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-25 15:53:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-25 15:53:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-25 15:53:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,686 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-25 15:53:57,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:53:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-25 15:53:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:53:57,688 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:53:57,688 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-25 15:53:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:57,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:57,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:53:57,805 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-25 15:53:57,806 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:57,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:58,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:58,249 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:58,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:58,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:58,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:58,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:58,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:58,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:58,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:53:58,272 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:53:58,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:53:58,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:53:58,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:53:58,313 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,343 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,357 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,368 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,379 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,415 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:58,416 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,424 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,433 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,449 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,477 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,478 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:53:58,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,503 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:58,503 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,527 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,528 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:58,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,554 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:58,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:58,564 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:58,647 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:58,647 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-02-25 15:53:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:58,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:58,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:58,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:58,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:58,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:58,722 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-25 15:54:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:01,778 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-25 15:54:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:01,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:54:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:01,783 INFO L225 Difference]: With dead ends: 1075 [2019-02-25 15:54:01,783 INFO L226 Difference]: Without dead ends: 1074 [2019-02-25 15:54:01,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-25 15:54:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-25 15:54:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-25 15:54:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-25 15:54:04,744 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-25 15:54:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:04,744 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-25 15:54:04,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-25 15:54:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:04,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:04,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:54:04,746 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-25 15:54:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:04,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:04,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:04,900 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:54:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:04,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:04,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:04,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:54:04,938 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-25 15:54:04,939 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:04,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:05,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:05,644 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:54:05,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:05,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:05,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:05,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:05,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:05,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:54:05,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:05,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:05,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,671 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:54:05,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,684 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:54:05,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:54:05,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:54:05,719 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,754 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,770 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,782 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,793 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,831 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:05,831 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,841 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,850 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,863 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,881 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,912 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:05,912 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:54:05,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:05,943 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,972 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:05,972 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:54:05,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:05,999 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:06,000 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:06,000 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:06,027 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:06,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:54:06,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,058 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:06,059 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:06,087 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:06,088 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 15:54:06,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,120 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:06,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:54:06,121 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:06,149 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:06,149 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:54:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:06,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:06,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:06,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:54:06,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:06,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:06,263 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-25 15:54:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:11,210 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-25 15:54:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:54:11,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:54:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:11,218 INFO L225 Difference]: With dead ends: 1522 [2019-02-25 15:54:11,218 INFO L226 Difference]: Without dead ends: 1521 [2019-02-25 15:54:11,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:54:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-25 15:54:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-25 15:54:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-25 15:54:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-25 15:54:14,415 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-25 15:54:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:14,415 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-25 15:54:14,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-25 15:54:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:14,417 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:14,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:54:14,418 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-25 15:54:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:14,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:14,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:14,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:14,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:54:14,443 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-25 15:54:14,444 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:14,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:15,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:15,665 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:54:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:15,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:15,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:15,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:15,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:15,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:15,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:54:15,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:15,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:15,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:54:15,703 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 15:54:15,720 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 15:54:15,741 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-25 15:54:15,742 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,821 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,830 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,840 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,850 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,858 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:15,858 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-25 15:54:15,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:15,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:54:15,864 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,865 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:15,865 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:54:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:15,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:15,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:54:15,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:54:15,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:54:15,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:54:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:54:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:54:15,898 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-25 15:54:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:19,985 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-25 15:54:19,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:54:19,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-25 15:54:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:19,993 INFO L225 Difference]: With dead ends: 1559 [2019-02-25 15:54:19,993 INFO L226 Difference]: Without dead ends: 1554 [2019-02-25 15:54:19,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:54:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-25 15:54:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-25 15:54:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-25 15:54:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-25 15:54:24,455 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-25 15:54:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:24,455 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-25 15:54:24,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:54:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-25 15:54:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:24,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:24,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:54:24,458 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-25 15:54:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:24,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:24,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:24,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:24,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:24,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:54:24,520 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-25 15:54:24,521 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:24,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:24,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:24,982 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:24,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:24,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:24,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:24,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:24,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:24,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:24,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:25,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:25,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:54:25,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,019 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:54:25,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,127 INFO L292 Elim1Store]: Index analysis took 106 ms [2019-02-25 15:54:25,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:54:25,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,254 INFO L292 Elim1Store]: Index analysis took 124 ms [2019-02-25 15:54:25,254 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:54:25,255 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,586 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,644 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,656 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,665 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:25,702 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,710 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,723 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,739 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,767 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:25,768 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:54:25,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:54:25,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,821 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:25,821 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:54:25,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:25,859 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:25,939 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:25,940 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 [2019-02-25 15:54:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:25,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:26,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:26,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:26,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:26,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:26,021 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-25 15:54:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:30,392 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-25 15:54:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:30,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:54:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:30,400 INFO L225 Difference]: With dead ends: 1574 [2019-02-25 15:54:30,400 INFO L226 Difference]: Without dead ends: 1570 [2019-02-25 15:54:30,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-25 15:54:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-25 15:54:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-25 15:54:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-25 15:54:34,889 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-25 15:54:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:34,889 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-25 15:54:34,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-25 15:54:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:34,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:34,892 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:54:34,892 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-25 15:54:34,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:34,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:34,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:34,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:34,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:34,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:34,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:34,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:34,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:34,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:34,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:34,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:34,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:34,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:34,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:34,988 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:54:34,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:34,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:34,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:54:35,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,007 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:54:35,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,016 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:54:35,017 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,041 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,054 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,065 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,076 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:35,112 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,121 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,134 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,150 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,178 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:35,179 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:54:35,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:54:35,207 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,231 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:35,231 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:54:35,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,272 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:35,273 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:35,355 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:35,356 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:68 [2019-02-25 15:54:35,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,397 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:35,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:54:35,398 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,414 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:35,414 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-25 15:54:35,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:54:35,442 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,459 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:35,460 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-25 15:54:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:35,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:35,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:35,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:54:35,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:35,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:54:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:54:35,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:35,549 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-25 15:54:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:41,670 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-25 15:54:41,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:41,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:54:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:41,679 INFO L225 Difference]: With dead ends: 2098 [2019-02-25 15:54:41,679 INFO L226 Difference]: Without dead ends: 2091 [2019-02-25 15:54:41,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:54:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-25 15:54:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-25 15:54:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-25 15:54:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-25 15:54:47,114 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-25 15:54:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:47,114 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-25 15:54:47,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:54:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-25 15:54:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:47,117 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:47,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:54:47,117 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-25 15:54:47,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:47,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:47,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:47,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:47,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:47,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:54:47,174 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-25 15:54:47,175 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:47,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:47,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:47,621 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:47,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:47,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:47,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:47,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:47,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:47,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:47,638 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:47,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:54:47,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:54:47,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,662 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:54:47,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:54:47,682 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,716 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,737 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,753 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,766 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,809 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:47,810 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,825 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,838 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,862 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,892 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:47,892 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:54:47,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,970 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:54:47,970 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:48,026 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:48,027 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:54:48,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,048 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:48,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:54:48,049 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:48,067 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:48,067 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:54:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:48,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:48,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:48,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:48,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:48,310 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-25 15:54:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:53,430 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-25 15:54:53,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:53,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:54:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:53,435 INFO L225 Difference]: With dead ends: 1846 [2019-02-25 15:54:53,435 INFO L226 Difference]: Without dead ends: 1839 [2019-02-25 15:54:53,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-25 15:54:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-25 15:54:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-25 15:54:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-25 15:54:58,806 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-25 15:54:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-25 15:54:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-25 15:54:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:54:58,808 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:58,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:54:58,808 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-25 15:54:58,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:58,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:59,201 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-02-25 15:54:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:59,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:59,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:59,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:54:59,271 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-25 15:54:59,272 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:59,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:59,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:59,517 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-02-25 15:54:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:59,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:59,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:59,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:59,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:59,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:59,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:59,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:59,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:54:59,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:54:59,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,560 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:54:59,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,576 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:54:59,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:54:59,590 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,619 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,633 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,644 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,653 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:59,690 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,698 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,708 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,724 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:59,752 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:59,753 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:54:59,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:59,795 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:59,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:59,893 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:84 [2019-02-25 15:54:59,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:59,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2019-02-25 15:54:59,945 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:55:00,011 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,049 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:00,050 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:104, output treesize:64 [2019-02-25 15:55:00,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,104 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:00,105 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:55:00,105 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,166 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:00,167 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:55:00,167 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,202 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:00,203 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:72 [2019-02-25 15:55:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:00,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:00,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:00,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:55:00,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:00,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:55:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:55:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:00,340 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-25 15:55:02,147 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-02-25 15:55:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:07,547 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-25 15:55:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:07,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:55:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:07,553 INFO L225 Difference]: With dead ends: 2193 [2019-02-25 15:55:07,553 INFO L226 Difference]: Without dead ends: 2192 [2019-02-25 15:55:07,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:55:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-25 15:55:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-25 15:55:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-25 15:55:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-25 15:55:13,314 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-25 15:55:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:13,314 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-25 15:55:13,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:55:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-25 15:55:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:55:13,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:13,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:55:13,317 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-25 15:55:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:13,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:13,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:13,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-02-25 15:55:13,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:13,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:13,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:13,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:13,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:13,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:13,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:13,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:13,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:55:13,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:13,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:55:13,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:13,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:55:13,432 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,452 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,465 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,486 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,512 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:55:13,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:55:13,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:55:13,549 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:55:13,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:55:13,551 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,588 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,607 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,618 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,628 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:13,659 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 15:55:13,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:13,692 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,721 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:13,722 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:55:13,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:13,753 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,783 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:13,783 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-25 15:55:13,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,813 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:13,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:55:13,814 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,839 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:13,840 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:55:13,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,952 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:13,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:55:13,953 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,980 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:13,980 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:55:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:14,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:14,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:55:14,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:14,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:14,072 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-25 15:55:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:21,472 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-25 15:55:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:21,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:55:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:21,479 INFO L225 Difference]: With dead ends: 2526 [2019-02-25 15:55:21,479 INFO L226 Difference]: Without dead ends: 2520 [2019-02-25 15:55:21,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:55:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-25 15:55:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-25 15:55:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-25 15:55:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-25 15:55:27,331 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-25 15:55:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:27,331 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-25 15:55:27,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-25 15:55:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:55:27,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:27,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:55:27,336 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-25 15:55:27,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:27,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:27,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:27,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:27,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:55:27,501 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-25 15:55:27,502 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:27,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:27,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:27,731 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-02-25 15:55:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:27,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:27,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:27,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:27,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:55:27,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:27,749 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:55:27,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:55:27,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:55:27,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:55:27,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,801 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:55:27,802 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,832 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,845 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,853 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,864 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:55:27,900 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,908 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,918 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,934 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:27,962 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:27,963 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:55:27,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,999 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:28,000 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:28,089 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:28,090 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:84 [2019-02-25 15:55:28,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,132 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:28,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:55:28,133 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,150 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:28,151 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:55:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:28,169 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-25 15:55:28,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:28,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:55:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:55:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:55:28,213 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-25 15:55:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:33,898 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-25 15:55:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:33,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:55:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:33,903 INFO L225 Difference]: With dead ends: 1971 [2019-02-25 15:55:33,903 INFO L226 Difference]: Without dead ends: 1964 [2019-02-25 15:55:33,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:55:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-25 15:55:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-25 15:55:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-25 15:55:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-25 15:55:39,759 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-25 15:55:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:39,759 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-25 15:55:39,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:55:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-25 15:55:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:55:39,764 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:39,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:55:39,764 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-25 15:55:39,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:39,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:39,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:39,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:39,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:39,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:39,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:39,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:39,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:39,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:55:39,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:39,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:55:39,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:39,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:55:39,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:55:39,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:55:39,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:55:39,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:39,938 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:55:39,939 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:39,969 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:39,982 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:39,993 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,004 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,039 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:55:40,040 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,048 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,061 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,077 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,105 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:40,105 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:55:40,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:55:40,151 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:40,169 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:55:40,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:55:40,194 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,212 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:40,212 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:55:40,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:40,239 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:40,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:55:40,240 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,257 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:40,257 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:55:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:40,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:40,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:55:40,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:40,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:55:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:55:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:40,334 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-25 15:55:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:46,338 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-25 15:55:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:46,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-25 15:55:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:46,343 INFO L225 Difference]: With dead ends: 2036 [2019-02-25 15:55:46,343 INFO L226 Difference]: Without dead ends: 2033 [2019-02-25 15:55:46,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-25 15:55:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-25 15:55:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-25 15:55:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-25 15:55:52,521 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-25 15:55:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:52,521 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-25 15:55:52,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:55:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-25 15:55:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:55:52,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:52,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:55:52,524 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-25 15:55:52,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:52,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:52,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:52,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:52,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:52,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:52,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:52,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:52,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:52,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:55:52,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:55:52,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:55:52,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:52,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:55:52,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:52,669 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-25 15:55:52,670 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,774 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,877 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,890 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:55:52,913 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 27 [2019-02-25 15:55:52,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:55:52,917 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:55:52,923 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-25 15:55:52,923 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,941 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,955 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,966 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,976 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:52,998 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-25 15:55:53,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-25 15:55:53,034 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:53,099 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:53,099 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-25 15:55:53,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:55:53,180 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:55:53,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,330 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:53,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2019-02-25 15:55:53,331 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,414 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-25 15:55:53,414 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-25 15:55:53,530 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-02-25 15:55:53,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-25 15:55:53,537 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:55:53,618 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,694 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:53,695 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:55:53,695 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,764 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:53,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:55:53,765 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,823 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 15:55:53,824 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-25 15:55:53,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,892 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:53,892 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2019-02-25 15:55:53,893 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:53,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:53,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:55:54,044 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:54,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,117 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:54,117 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:55:54,118 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:54,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:54,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2019-02-25 15:55:54,188 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:54,246 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:55:54,247 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-25 15:55:54,376 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-02-25 15:55:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:54,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:54,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:54,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:55:54,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:54,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:55:54,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:55:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:54,524 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-25 15:56:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:03,987 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-25 15:56:03,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:56:03,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:56:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:03,996 INFO L225 Difference]: With dead ends: 2952 [2019-02-25 15:56:03,996 INFO L226 Difference]: Without dead ends: 2951 [2019-02-25 15:56:03,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:56:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-25 15:56:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-25 15:56:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-25 15:56:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-25 15:56:09,413 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-25 15:56:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:09,414 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-25 15:56:09,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:56:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-25 15:56:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:09,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:09,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:09,416 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-25 15:56:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:09,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:09,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:56:09,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:09,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:09,633 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-25 15:56:09,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:09,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:09,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:09,827 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-02-25 15:56:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:09,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:09,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:09,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:56:09,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:09,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:56:09,884 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,897 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,909 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,925 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:56:09,948 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:56:09,951 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:56:09,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:56:09,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:56:09,957 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,979 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:09,992 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,002 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,012 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,040 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:10,041 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:56:10,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:56:10,077 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:56:10,165 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:56:10,166 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-25 15:56:10,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,231 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:10,232 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2019-02-25 15:56:10,232 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:56:10,291 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,344 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:56:10,345 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-25 15:56:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:10,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:10,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:10,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-25 15:56:10,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:10,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:56:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:56:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:56:10,447 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-25 15:56:10,730 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-25 15:56:10,900 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-25 15:56:11,062 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-02-25 15:56:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:16,934 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-25 15:56:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:56:16,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:56:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:16,940 INFO L225 Difference]: With dead ends: 1903 [2019-02-25 15:56:16,940 INFO L226 Difference]: Without dead ends: 1896 [2019-02-25 15:56:16,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:56:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-25 15:56:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-25 15:56:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-25 15:56:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-25 15:56:22,972 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-25 15:56:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:22,972 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-25 15:56:22,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:56:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-25 15:56:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:22,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:22,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:22,976 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-25 15:56:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:22,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:56:23,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:23,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:23,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:23,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:23,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:23,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:23,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:56:23,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:56:23,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:56:23,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:23,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:56:23,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:23,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:56:23,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:56:23,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:56:23,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,125 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:56:23,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:56:23,134 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,161 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,174 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,185 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,197 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,231 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:56:23,231 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,240 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,249 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,266 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,294 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:23,294 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:56:23,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:56:23,317 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:23,343 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:23,343 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:56:23,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:23,370 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:23,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:56:23,379 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:56:23,461 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:56:23,461 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-02-25 15:56:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:23,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:23,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:23,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:56:23,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:23,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:56:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:56:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:56:23,551 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-25 15:56:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:29,290 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-25 15:56:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:56:29,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:56:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:29,295 INFO L225 Difference]: With dead ends: 1884 [2019-02-25 15:56:29,295 INFO L226 Difference]: Without dead ends: 1877 [2019-02-25 15:56:29,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:56:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-25 15:56:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-25 15:56:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-25 15:56:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-25 15:56:35,406 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-25 15:56:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-25 15:56:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:56:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-25 15:56:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:56:35,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:35,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:35,410 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-25 15:56:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:35,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:35,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:35,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:35,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:35,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:56:35,534 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-25 15:56:35,535 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:35,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:35,802 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:35,802 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:56:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:35,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:35,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:35,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:35,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:35,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:35,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:56:35,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:35,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:56:35,847 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,861 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,878 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,899 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:56:35,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:56:35,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:56:35,934 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:56:35,937 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:56:35,938 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,959 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,971 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,981 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:35,991 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:36,019 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:36,020 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:56:36,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:56:36,047 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:36,074 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:36,074 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:56:36,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2019-02-25 15:56:36,103 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:36,129 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:36,129 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-25 15:56:36,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:36,167 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:36,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:36,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:56:36,254 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:56:36,254 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-25 15:56:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:36,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:36,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:56:36,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:36,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:56:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:56:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:56:36,337 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-25 15:56:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:45,476 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-25 15:56:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:56:45,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:56:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:45,484 INFO L225 Difference]: With dead ends: 2991 [2019-02-25 15:56:45,485 INFO L226 Difference]: Without dead ends: 2978 [2019-02-25 15:56:45,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:56:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-25 15:56:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-25 15:56:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-25 15:56:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-25 15:56:53,333 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-25 15:56:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:53,334 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-25 15:56:53,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:56:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-25 15:56:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:56:53,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:53,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:53,337 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-25 15:56:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:53,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:56:53,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:53,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:53,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:56:53,430 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-25 15:56:53,431 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:53,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:53,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:53,826 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-25 15:56:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:53,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:53,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:53,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:53,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:53,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:56:53,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:53,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:56:53,892 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:53,905 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:53,914 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:53,925 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:53,944 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:53,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:56:53,985 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:56:54,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:56:54,019 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:56:54,035 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:56:54,036 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,169 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,183 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,195 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,205 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,235 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,235 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:56:54,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,274 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:56:54,274 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,303 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:54,303 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:56:54,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:54,340 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:54,368 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:56:54,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,402 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:54,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:54,403 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,431 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:54,432 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:56:54,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,464 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:54,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:54,465 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,491 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:54,491 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:36 [2019-02-25 15:56:54,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:54,525 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:54,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:56:54,526 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:54,553 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:54,553 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-25 15:56:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:54,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:54,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:54,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-25 15:56:54,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:54,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:56:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:56:54,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:56:54,840 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-25 15:57:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:05,298 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-25 15:57:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:57:05,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-25 15:57:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:05,307 INFO L225 Difference]: With dead ends: 3181 [2019-02-25 15:57:05,307 INFO L226 Difference]: Without dead ends: 3179 [2019-02-25 15:57:05,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:57:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-25 15:57:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-25 15:57:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-25 15:57:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-25 15:57:13,131 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-25 15:57:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:13,131 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-25 15:57:13,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:57:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-25 15:57:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:13,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:13,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:13,135 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-25 15:57:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:13,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:13,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:57:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:57:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:57:13,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:57:13,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:57:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:57:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:57:13,211 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-25 15:57:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:20,306 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-25 15:57:20,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:57:20,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:57:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:20,313 INFO L225 Difference]: With dead ends: 2346 [2019-02-25 15:57:20,313 INFO L226 Difference]: Without dead ends: 2337 [2019-02-25 15:57:20,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:57:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-25 15:57:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-25 15:57:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-25 15:57:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-25 15:57:27,948 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-25 15:57:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:27,948 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-25 15:57:27,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:57:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-25 15:57:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:27,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:27,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:27,952 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-25 15:57:27,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:27,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:27,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:27,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:57:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:28,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:28,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:28,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:28,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:28,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:28,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:57:28,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:57:28,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:57:28,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:28,087 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:57:28,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:28,120 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:57:28,121 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,131 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,137 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,147 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,166 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:57:28,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 15:57:28,196 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 15:57:28,212 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 15:57:28,214 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 15:57:28,214 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,238 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,252 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,263 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,273 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,303 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,304 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-25 15:57:28,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:57:28,342 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,401 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:28,401 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:57:28,694 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-25 15:57:28,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,703 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:57:28,704 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,733 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:28,733 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:57:28,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,766 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:28,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:57:28,767 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,794 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:28,794 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:36 [2019-02-25 15:57:28,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,832 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:28,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:57:28,833 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,861 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:28,861 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-25 15:57:28,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:28,894 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:28,895 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:57:28,895 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:28,923 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:28,923 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-25 15:57:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:28,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-25 15:57:29,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:57:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:57:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:57:29,059 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-25 15:57:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:37,226 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-25 15:57:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:57:37,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-25 15:57:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:37,233 INFO L225 Difference]: With dead ends: 2345 [2019-02-25 15:57:37,233 INFO L226 Difference]: Without dead ends: 2338 [2019-02-25 15:57:37,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:57:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-25 15:57:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-25 15:57:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-25 15:57:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-25 15:57:39,467 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-25 15:57:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:39,467 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-25 15:57:39,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:57:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-25 15:57:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:39,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:39,468 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:39,469 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-25 15:57:39,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:39,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:39,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:57:39,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:39,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:39,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:57:39,533 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-25 15:57:39,533 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:39,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:39,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:39,782 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-02-25 15:57:39,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:39,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:39,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:39,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:39,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:39,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:57:39,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:39,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:57:39,831 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:57:39,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:39,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:39,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:57:39,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:39,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:39,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:39,854 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:57:39,868 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:57:39,869 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,896 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,910 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,920 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,931 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:57:39,960 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,964 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,973 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:39,993 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:39,993 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:57:40,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:57:40,022 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,033 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,033 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-25 15:57:40,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,051 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:40,051 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,061 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,061 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-25 15:57:40,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 15:57:40,081 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,091 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:40,092 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-25 15:57:40,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:40,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:40,113 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:40,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:40,123 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-25 15:57:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:40,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:40,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:40,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:57:40,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:40,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:57:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:57:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:57:40,201 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-25 15:57:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:42,526 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-25 15:57:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:57:42,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:57:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:42,529 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:57:42,529 INFO L226 Difference]: Without dead ends: 477 [2019-02-25 15:57:42,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:57:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-25 15:57:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-25 15:57:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-25 15:57:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-25 15:57:43,456 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-25 15:57:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:43,456 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-25 15:57:43,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:57:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-25 15:57:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:43,457 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:43,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:43,457 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-25 15:57:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:43,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:43,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:43,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:57:43,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:43,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:43,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:57:43,516 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-25 15:57:43,517 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:43,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:43,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:43,783 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:57:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:43,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:43,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:43,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:43,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:43,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:43,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:57:43,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:43,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:57:43,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:57:43,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,816 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:57:43,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:57:43,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:43,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:57:43,844 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,879 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,892 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,903 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,912 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:57:43,946 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,954 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,963 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:43,980 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:44,008 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:44,008 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:57:44,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:57:44,045 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:44,063 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:44,063 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:57:44,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:57:44,089 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:44,107 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:44,107 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:57:44,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:44,168 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:44,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:57:44,169 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:44,186 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:44,186 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:57:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:44,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:44,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:57:44,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:44,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:57:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:57:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:57:44,256 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-25 15:57:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:46,094 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-25 15:57:46,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:57:46,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-25 15:57:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:46,096 INFO L225 Difference]: With dead ends: 250 [2019-02-25 15:57:46,096 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:57:46,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:57:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:57:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-25 15:57:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:57:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-25 15:57:47,587 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-25 15:57:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:47,587 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-25 15:57:47,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:57:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-25 15:57:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:47,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:47,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:47,588 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:47,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-25 15:57:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:47,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:57:47,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:47,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:47,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:57:47,689 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-25 15:57:47,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:47,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:47,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:47,938 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:57:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:47,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:47,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:47,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:47,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:47,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:47,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:57:47,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:47,958 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:57:47,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-02-25 15:57:47,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,970 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:57:47,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:57:47,996 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-25 15:57:47,996 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,030 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,042 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,051 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,062 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,087 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:57:48,088 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,093 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,102 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,122 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:48,122 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-25 15:57:48,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:57:48,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,166 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,166 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-25 15:57:48,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:48,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,196 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:48,196 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-25 15:57:48,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:48,213 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:48,214 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:48,214 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:48,225 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:48,225 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-25 15:57:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:48,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:48,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:48,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:57:48,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:48,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:57:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:57:48,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:57:48,289 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-25 15:57:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:51,601 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-25 15:57:51,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:57:51,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:57:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:51,603 INFO L225 Difference]: With dead ends: 372 [2019-02-25 15:57:51,603 INFO L226 Difference]: Without dead ends: 362 [2019-02-25 15:57:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:57:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-25 15:57:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-25 15:57:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-25 15:57:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-25 15:57:53,977 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-25 15:57:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:53,977 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-25 15:57:53,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:57:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-25 15:57:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:57:53,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:53,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:53,978 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-25 15:57:53,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:53,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:54,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:54,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:54,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:54,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:54,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:54,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:54,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:57:54,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:57:54,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:57:54,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:54,073 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:57:54,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:54,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:57:54,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:57:54,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:57:54,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,201 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:57:54,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,210 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:57:54,211 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,236 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,249 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,258 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,269 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,304 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:57:54,305 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,313 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,322 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,339 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,367 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:54,367 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:57:54,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:57:54,393 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,418 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:54,419 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:57:54,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,462 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:54,468 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:57:54,469 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:57:54,553 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:57:54,554 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-02-25 15:57:54,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:54,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:57:54,594 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:54,612 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:54,612 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:57:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:54,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:54,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:54,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:57:54,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:54,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:57:54,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:57:54,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:57:54,698 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-25 15:57:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:57,624 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-25 15:57:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:57:57,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:57:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:57,626 INFO L225 Difference]: With dead ends: 332 [2019-02-25 15:57:57,626 INFO L226 Difference]: Without dead ends: 325 [2019-02-25 15:57:57,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:57:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-25 15:58:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-25 15:58:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-25 15:58:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-25 15:58:00,165 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-25 15:58:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:00,165 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-25 15:58:00,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:58:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-25 15:58:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:58:00,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:00,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:00,166 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-25 15:58:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:00,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:00,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:00,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:00,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:00,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:58:00,237 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-25 15:58:00,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:00,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:00,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:00,779 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:00,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:00,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:00,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:00,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:00,791 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:58:00,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:00,822 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:00,822 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,834 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,850 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,872 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,894 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:00,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:00,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:00,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:00,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:00,906 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,929 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,941 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,951 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,961 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:00,989 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:00,989 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:01,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:58:01,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:01,056 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:01,056 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:58:01,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,112 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:01,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:58:01,113 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:01,130 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:01,130 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:58:01,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:01,156 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:01,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:58:01,157 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:01,175 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:01,175 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:58:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:01,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:01,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:01,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:58:01,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:01,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:58:01,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:58:01,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:58:01,260 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-25 15:58:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:03,902 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-25 15:58:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:58:03,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-25 15:58:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:03,904 INFO L225 Difference]: With dead ends: 294 [2019-02-25 15:58:03,904 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:58:03,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:58:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:58:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-25 15:58:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-25 15:58:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-25 15:58:06,357 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-25 15:58:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:06,357 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-25 15:58:06,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:58:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-25 15:58:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:58:06,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:06,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:06,358 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-25 15:58:06,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:06,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:06,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:06,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:06,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:06,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:06,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:58:06,481 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-25 15:58:06,482 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:06,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:07,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:07,023 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:07,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:07,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:07,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:07,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:07,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:07,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:58:07,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:07,084 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:07,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:07,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,092 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:07,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:07,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:07,113 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,139 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,154 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,166 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,175 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,210 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:07,211 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,219 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,228 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,244 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,272 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:07,273 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:07,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:58:07,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,335 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:07,335 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:58:07,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:58:07,377 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:58:07,458 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:07,458 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:70 [2019-02-25 15:58:07,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,537 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:07,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:58:07,538 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:07,589 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:07,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:58:07,590 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:07,635 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:07,635 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-25 15:58:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:07,686 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:58:07,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:07,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:58:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:58:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:58:07,739 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-25 15:58:08,239 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-02-25 15:58:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:11,319 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-25 15:58:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:58:11,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:58:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:11,321 INFO L225 Difference]: With dead ends: 364 [2019-02-25 15:58:11,321 INFO L226 Difference]: Without dead ends: 357 [2019-02-25 15:58:11,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:58:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-25 15:58:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-25 15:58:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-25 15:58:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-25 15:58:13,874 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-25 15:58:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:13,874 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-25 15:58:13,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:58:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-25 15:58:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:58:13,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:13,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:13,875 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-25 15:58:13,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:13,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:13,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:13,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:14,184 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-02-25 15:58:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:14,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:14,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:14,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:58:14,217 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-25 15:58:14,218 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:14,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:14,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:14,759 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:14,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:14,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:14,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:14,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:14,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:14,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:58:14,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:14,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:14,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:14,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:14,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,808 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:14,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:14,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:14,822 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,851 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,866 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,877 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,888 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:14,922 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,931 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,943 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,959 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:14,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:14,988 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:15,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:58:15,033 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:15,050 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:15,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:58:15,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:58:15,076 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:15,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:15,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:58:15,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:15,119 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:15,120 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:58:15,120 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:15,137 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:15,138 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:58:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:15,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:15,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:15,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:58:15,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:15,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:58:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:58:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:58:15,208 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-25 15:58:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:18,308 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-25 15:58:18,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:58:18,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-25 15:58:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:18,310 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:58:18,310 INFO L226 Difference]: Without dead ends: 312 [2019-02-25 15:58:18,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:58:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-25 15:58:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-25 15:58:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 15:58:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-25 15:58:21,293 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-25 15:58:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:21,293 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-25 15:58:21,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:58:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-25 15:58:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:58:21,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:21,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:21,294 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-25 15:58:21,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:21,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:21,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:58:21,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:21,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:21,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:58:21,419 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-25 15:58:21,420 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:21,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:21,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:21,669 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:21,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:21,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:21,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:21,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:21,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:21,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:58:21,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:21,721 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:21,721 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,733 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,747 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,768 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,791 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:21,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:21,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:21,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:21,808 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:21,809 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,830 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,842 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,852 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,862 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:21,890 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:21,891 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:21,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:21,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:58:21,931 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:58:22,020 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:22,020 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 15:58:22,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,119 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 15:58:22,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:22,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 15:58:22,178 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:22,220 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:22,221 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-25 15:58:22,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,311 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:22,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:58:22,312 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:22,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:22,363 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:22,364 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2019-02-25 15:58:22,364 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:22,401 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:22,401 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-25 15:58:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:22,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:22,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:22,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:58:22,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:22,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:58:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:58:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:58:22,516 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-25 15:58:23,960 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-25 15:58:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:26,982 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-25 15:58:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:58:26,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:58:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:26,984 INFO L225 Difference]: With dead ends: 392 [2019-02-25 15:58:26,984 INFO L226 Difference]: Without dead ends: 386 [2019-02-25 15:58:26,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:58:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-25 15:58:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-25 15:58:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-25 15:58:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-25 15:58:30,144 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-25 15:58:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-25 15:58:30,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:58:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-25 15:58:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:58:30,145 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:30,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:30,146 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-25 15:58:30,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:30,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:30,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:30,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:58:30,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:58:30,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:58:30,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:58:30,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:58:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:58:30,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:58:30,226 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-25 15:58:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:33,225 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-25 15:58:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:58:33,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:58:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:33,226 INFO L225 Difference]: With dead ends: 320 [2019-02-25 15:58:33,226 INFO L226 Difference]: Without dead ends: 315 [2019-02-25 15:58:33,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:58:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-25 15:58:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-25 15:58:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-25 15:58:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-25 15:58:36,375 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-25 15:58:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:36,375 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-25 15:58:36,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:58:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-25 15:58:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:58:36,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:36,376 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:36,376 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-25 15:58:36,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:36,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:36,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:36,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:36,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:36,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:36,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:36,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:36,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:58:36,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:58:36,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:58:36,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:36,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:58:36,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:36,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:36,525 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,533 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,544 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,561 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,582 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:36,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:36,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:36,591 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:36,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:36,595 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,616 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,629 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,639 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,649 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,677 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:36,677 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:36,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,705 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:58:36,705 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,744 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:36,744 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:58:36,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 62 [2019-02-25 15:58:36,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:36,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:36,803 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-25 15:58:36,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:36,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:58:36,847 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:58:36,928 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:36,929 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-25 15:58:37,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:37,036 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:37,036 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:58:37,037 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:37,055 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:37,055 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:58:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:37,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:37,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:58:37,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:58:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:58:37,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:58:37,158 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-25 15:58:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:43,507 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-25 15:58:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:58:43,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:58:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:43,509 INFO L225 Difference]: With dead ends: 601 [2019-02-25 15:58:43,509 INFO L226 Difference]: Without dead ends: 591 [2019-02-25 15:58:43,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:58:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-25 15:58:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-25 15:58:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-25 15:58:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-25 15:58:48,806 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-25 15:58:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:48,806 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-25 15:58:48,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:58:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-25 15:58:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:58:48,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:48,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:48,807 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-25 15:58:48,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:48,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:48,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:48,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:48,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:48,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:58:48,894 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 15:58:48,895 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:48,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:49,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:49,162 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:49,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:49,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:49,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:49,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:49,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:49,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:49,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:58:49,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:49,211 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:58:49,211 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,228 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,238 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,258 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:58:49,286 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:58:49,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:58:49,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:58:49,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:58:49,295 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,316 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,328 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,338 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,348 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,377 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:49,377 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 15:58:49,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:58:49,402 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,428 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:49,428 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:58:49,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2019-02-25 15:58:49,460 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:49,484 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:58:49,485 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-25 15:58:49,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:49,530 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:49,538 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:58:49,539 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:58:49,640 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:58:49,641 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:68 [2019-02-25 15:58:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:49,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:49,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:49,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:58:49,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:49,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:58:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:58:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:58:49,727 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-25 15:58:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:59,568 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-25 15:58:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:58:59,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:58:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:59,570 INFO L225 Difference]: With dead ends: 731 [2019-02-25 15:58:59,570 INFO L226 Difference]: Without dead ends: 718 [2019-02-25 15:58:59,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:58:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-25 15:59:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-25 15:59:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-25 15:59:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-25 15:59:08,102 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-25 15:59:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:08,103 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-25 15:59:08,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:59:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-25 15:59:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:59:08,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:08,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:08,104 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-25 15:59:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:08,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:08,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:08,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:59:08,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:08,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:08,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:59:08,254 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-25 15:59:08,255 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:08,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:08,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:08,584 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:59:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:08,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:08,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:08,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:08,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:08,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:08,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:59:08,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:08,635 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:59:08,635 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,651 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,667 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,687 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:59:08,716 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:59:08,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:59:08,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:59:08,725 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:59:08,725 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,748 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,761 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,771 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,781 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,808 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:08,808 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:59:08,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:59:08,857 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,875 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,875 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-25 15:59:08,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:59:08,905 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,922 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:08,923 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-25 15:59:08,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,949 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:08,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:59:08,950 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:08,965 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:08,966 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-25 15:59:08,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:08,993 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:08,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:59:08,994 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:09,013 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:09,013 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-25 15:59:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:09,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:09,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:59:09,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:09,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:59:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:59:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:59:09,124 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-25 15:59:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:19,300 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-25 15:59:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:59:19,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:59:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:19,302 INFO L225 Difference]: With dead ends: 480 [2019-02-25 15:59:19,302 INFO L226 Difference]: Without dead ends: 473 [2019-02-25 15:59:19,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:59:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-25 15:59:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-25 15:59:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:59:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-25 15:59:22,622 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-25 15:59:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:22,622 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-25 15:59:22,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:59:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-25 15:59:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:59:22,623 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:22,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:22,624 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-25 15:59:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:22,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:22,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:59:22,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:22,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:22,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:59:22,736 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-25 15:59:22,737 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:22,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:22,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:22,990 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:59:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:22,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:22,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:22,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:22,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:23,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:59:23,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:23,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:59:23,012 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:59:23,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:59:23,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,035 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:59:23,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:59:23,055 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,083 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,098 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,107 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,119 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:59:23,154 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,162 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,173 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,189 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,217 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:23,217 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 15:59:23,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:59:23,265 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,281 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:23,281 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:59:23,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:59:23,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,327 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:23,327 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:59:23,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:23,353 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:23,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:59:23,354 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:23,370 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:23,370 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:59:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:23,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:59:23,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:23,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:59:23,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:59:23,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:59:23,437 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-25 15:59:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:28,735 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-25 15:59:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:59:28,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:59:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:28,737 INFO L225 Difference]: With dead ends: 258 [2019-02-25 15:59:28,737 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:59:28,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:59:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:59:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-25 15:59:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-25 15:59:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-25 15:59:33,328 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-25 15:59:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:33,328 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-25 15:59:33,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:59:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-25 15:59:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:59:33,329 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:33,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:33,330 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-25 15:59:33,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:33,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:33,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:59:33,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:33,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:33,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:59:33,493 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-25 15:59:33,494 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:33,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:34,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:34,140 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:59:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:34,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:34,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:34,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:34,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:34,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:59:34,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:34,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:59:34,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-02-25 15:59:34,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:59:34,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:59:34,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,204 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:59:34,205 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,233 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,246 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,255 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,266 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:59:34,299 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,309 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,325 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,340 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,368 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-25 15:59:34,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:59:34,409 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,434 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:34,435 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-25 15:59:34,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,470 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:34,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:59:34,483 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:59:34,565 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:59:34,565 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:76 [2019-02-25 15:59:34,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,648 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:34,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2019-02-25 15:59:34,649 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2019-02-25 15:59:34,709 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,773 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:59:34,773 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-25 15:59:34,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,829 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:34,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-25 15:59:34,830 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:34,888 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:34,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 49 [2019-02-25 15:59:34,889 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:34,929 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:59:34,929 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-25 15:59:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:34,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:35,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:35,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:59:35,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:35,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:59:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:59:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:59:35,038 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-25 15:59:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:41,283 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-25 15:59:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:59:41,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:59:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:41,285 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:59:41,285 INFO L226 Difference]: Without dead ends: 284 [2019-02-25 15:59:41,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:59:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-25 15:59:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-25 15:59:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:59:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-25 15:59:46,087 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-25 15:59:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:46,087 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-25 15:59:46,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:59:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-25 15:59:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:59:46,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:46,088 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:46,088 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-25 15:59:46,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:46,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:46,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:46,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:59:46,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:46,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:46,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:59:46,180 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-25 15:59:46,180 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:46,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:46,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:46,642 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:59:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:46,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:46,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:46,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:46,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:46,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:59:46,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:46,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 15:59:46,668 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 15:59:46,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,683 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 15:59:46,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,695 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 15:59:46,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 15:59:46,709 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,734 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,746 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,757 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,768 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:59:46,803 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,812 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,822 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,839 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,867 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:46,867 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-25 15:59:46,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:59:46,888 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,913 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:46,913 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:59:46,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:46,944 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:59:46,945 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:59:47,027 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:59:47,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:59:47,068 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:47,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:59:47,075 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:47,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:47,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:25 [2019-02-25 15:59:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:47,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:47,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:47,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:59:47,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:47,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:59:47,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:59:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:59:47,157 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-25 15:59:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:54,178 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-25 15:59:54,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:59:54,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 15:59:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:54,180 INFO L225 Difference]: With dead ends: 328 [2019-02-25 15:59:54,180 INFO L226 Difference]: Without dead ends: 315 [2019-02-25 15:59:54,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:59:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-25 16:00:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-25 16:00:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-25 16:00:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-25 16:00:00,907 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-25 16:00:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:00,908 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-25 16:00:00,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 16:00:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-25 16:00:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 16:00:00,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:00,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:00:00,909 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-25 16:00:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:00,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:00,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 16:00:01,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:01,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:01,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 16:00:01,035 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-25 16:00:01,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:00:01,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:00:01,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:00:01,287 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:00:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:01,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:00:01,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:01,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:01,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:01,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 16:00:01,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:01,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 16:00:01,336 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,356 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,365 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,379 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,400 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,425 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:00:01,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 16:00:01,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 16:00:01,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 16:00:01,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 16:00:01,435 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,459 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,473 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,485 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,495 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,525 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:01,526 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 16:00:01,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:01,561 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,589 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:01,589 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 16:00:01,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:01,622 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:01,651 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 16:00:01,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:01,684 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:01,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 16:00:01,685 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:01,714 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:01,715 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 16:00:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:01,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:01,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:01,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 16:00:01,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:01,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 16:00:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 16:00:01,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-25 16:00:01,805 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-25 16:00:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:11,321 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-25 16:00:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 16:00:11,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-25 16:00:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:11,323 INFO L225 Difference]: With dead ends: 326 [2019-02-25 16:00:11,323 INFO L226 Difference]: Without dead ends: 313 [2019-02-25 16:00:11,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-25 16:00:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-25 16:00:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-25 16:00:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-25 16:00:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-25 16:00:19,591 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-25 16:00:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:19,592 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-25 16:00:19,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 16:00:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-25 16:00:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 16:00:19,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:19,592 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:00:19,593 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-25 16:00:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:19,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 16:00:19,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:19,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:19,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 16:00:19,686 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-25 16:00:19,686 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:00:19,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:00:19,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:00:19,982 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:00:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:19,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:00:19,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:19,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:19,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:20,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:00:20,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:20,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:00:20,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:00:20,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,172 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:00:20,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,282 INFO L292 Elim1Store]: Index analysis took 109 ms [2019-02-25 16:00:20,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:00:20,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,386 INFO L292 Elim1Store]: Index analysis took 101 ms [2019-02-25 16:00:20,386 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:00:20,387 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,598 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,612 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,622 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,633 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:00:20,667 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,675 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,684 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,700 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:20,728 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:20,729 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 16:00:20,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:20,761 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:20,761 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:00:20,850 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:00:20,850 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 16:00:21,088 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 29 [2019-02-25 16:00:21,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,093 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:21,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 16:00:21,094 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:21,110 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:21,110 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-25 16:00:21,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 16:00:21,135 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:21,152 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:21,152 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 16:00:21,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:21,181 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 16:00:21,182 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:21,199 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:21,200 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-25 16:00:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:21,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 16:00:21,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 16:00:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 16:00:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 16:00:21,283 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-25 16:00:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:32,697 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-25 16:00:32,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 16:00:32,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-25 16:00:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:32,699 INFO L225 Difference]: With dead ends: 400 [2019-02-25 16:00:32,699 INFO L226 Difference]: Without dead ends: 393 [2019-02-25 16:00:32,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-25 16:00:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-25 16:00:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-25 16:00:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-25 16:00:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-25 16:00:42,962 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-25 16:00:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:42,962 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-25 16:00:42,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 16:00:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-25 16:00:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 16:00:42,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:42,963 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:00:42,963 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-25 16:00:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:42,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 16:00:43,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:43,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:43,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 16:00:43,073 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-25 16:00:43,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:00:43,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:00:43,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:00:43,323 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:00:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:43,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:00:43,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:43,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:43,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:43,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:43,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:00:43,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:43,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:00:43,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:00:43,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:00:43,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:00:43,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:00:43,390 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,420 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,434 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,446 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,457 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:00:43,493 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,500 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,515 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,531 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:00:43,560 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-25 16:00:43,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:43,595 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:00:43,685 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:00:43,685 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-25 16:00:43,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,753 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:43,754 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2019-02-25 16:00:43,754 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,814 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:43,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 16:00:43,815 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,859 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:00:43,859 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:76 [2019-02-25 16:00:43,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2019-02-25 16:00:43,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:43,960 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:43,961 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2019-02-25 16:00:43,961 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:43,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:00:43,997 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-25 16:00:44,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,050 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 70 [2019-02-25 16:00:44,051 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:44,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:44,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 47 [2019-02-25 16:00:44,123 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:44,157 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 16:00:44,158 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-25 16:00:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:44,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:44,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 16:00:44,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:44,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 16:00:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 16:00:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-25 16:00:44,271 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-25 16:00:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:56,916 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-25 16:00:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 16:00:56,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-25 16:00:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:56,918 INFO L225 Difference]: With dead ends: 441 [2019-02-25 16:00:56,918 INFO L226 Difference]: Without dead ends: 428 [2019-02-25 16:00:56,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-25 16:00:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-25 16:01:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-25 16:01:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-25 16:01:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-25 16:01:07,319 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-25 16:01:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:07,320 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-25 16:01:07,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 16:01:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-25 16:01:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 16:01:07,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:07,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:01:07,321 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-25 16:01:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:07,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:07,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:07,612 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-02-25 16:01:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-25 16:01:07,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:07,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:07,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 16:01:07,694 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-25 16:01:07,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:01:07,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:01:08,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:01:08,018 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 16:01:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:08,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:01:08,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:08,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:01:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:08,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:01:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:08,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:01:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:08,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:01:08,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-02-25 16:01:08,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:01:08,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,214 INFO L292 Elim1Store]: Index analysis took 102 ms [2019-02-25 16:01:08,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:01:08,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,274 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:01:08,274 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,301 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,313 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,324 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,335 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:01:08,371 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,380 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,389 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,405 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,433 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:01:08,434 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 16:01:08,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,472 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:01:08,472 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:01:08,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:08,561 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 16:01:08,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,647 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-25 16:01:08,648 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2019-02-25 16:01:08,708 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,770 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:08,770 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-25 16:01:08,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,818 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:08,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 16:01:08,819 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,889 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:08,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 16:01:08,890 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:08,925 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:08,925 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-25 16:01:08,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:08,972 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:08,972 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2019-02-25 16:01:08,973 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:09,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:09,025 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:09,025 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 70 [2019-02-25 16:01:09,026 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:09,068 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:09,069 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-25 16:01:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:09,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 16:01:09,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:09,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 16:01:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 16:01:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-25 16:01:09,205 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-25 16:01:20,805 WARN L181 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-02-25 16:01:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:33,388 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-25 16:01:33,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 16:01:33,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 16:01:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:33,390 INFO L225 Difference]: With dead ends: 685 [2019-02-25 16:01:33,390 INFO L226 Difference]: Without dead ends: 677 [2019-02-25 16:01:33,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-25 16:01:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-25 16:01:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-25 16:01:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-25 16:01:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-25 16:01:49,165 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-25 16:01:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:49,165 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-25 16:01:49,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 16:01:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-25 16:01:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 16:01:49,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:49,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:01:49,166 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-25 16:01:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:49,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:49,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:49,454 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-25 16:01:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 16:01:49,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:49,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:49,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:01:49,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:01:49,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:49,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:01:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:01:49,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:01:49,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 16:01:49,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:01:49,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:01:49,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:49,580 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:01:49,580 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,589 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,600 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,617 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:01:49,642 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:01:49,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:01:49,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:01:49,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:01:49,652 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,674 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,686 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,696 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,706 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:49,735 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:01:49,736 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 16:01:49,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:01:49,778 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:01:49,866 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:49,867 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-25 16:01:49,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:49,958 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 16:01:49,959 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,018 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:50,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-02-25 16:01:50,019 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,059 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:50,060 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-25 16:01:50,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,130 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:50,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 16:01:50,131 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,189 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-25 16:01:50,189 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,227 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:50,227 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-25 16:01:50,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,286 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 16:01:50,286 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:50,342 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:50,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-25 16:01:50,343 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:50,387 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:50,387 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-25 16:01:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:50,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:50,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:50,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 16:01:50,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:50,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:01:50,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:01:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-25 16:01:50,529 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-25 16:01:50,730 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-02-25 16:01:51,241 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-25 16:01:52,132 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-02-25 16:02:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:05,744 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-25 16:02:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 16:02:05,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-25 16:02:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:05,746 INFO L225 Difference]: With dead ends: 550 [2019-02-25 16:02:05,746 INFO L226 Difference]: Without dead ends: 543 [2019-02-25 16:02:05,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-25 16:02:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-25 16:02:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-25 16:02:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 16:02:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-25 16:02:08,851 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-25 16:02:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:08,852 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-25 16:02:08,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:02:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-25 16:02:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 16:02:08,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:08,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:08,852 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-25 16:02:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:08,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:02:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:08,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 16:02:09,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:09,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:09,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 16:02:09,032 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 16:02:09,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:02:09,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:02:09,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:02:09,363 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 16:02:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:09,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:02:09,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:09,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:09,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:02:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:09,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 16:02:09,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:09,570 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 16:02:09,570 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,580 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,591 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,608 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,627 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:02:09,653 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-25 16:02:09,655 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-25 16:02:09,657 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-25 16:02:09,659 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-25 16:02:09,659 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,684 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,698 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,710 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,720 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,750 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:09,751 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-25 16:02:09,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:02:09,786 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,813 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:09,814 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 16:02:09,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,848 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 16:02:09,849 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,877 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:09,878 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 16:02:09,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,913 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:09,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 16:02:09,914 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:09,941 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:09,942 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 16:02:09,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:09,979 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:09,980 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 16:02:09,980 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:10,006 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:10,006 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-25 16:02:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:10,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:10,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:10,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 16:02:10,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:02:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:02:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-25 16:02:10,792 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-25 16:02:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:16,764 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-25 16:02:16,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:02:16,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-25 16:02:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:16,765 INFO L225 Difference]: With dead ends: 67 [2019-02-25 16:02:16,765 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 16:02:16,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-02-25 16:02:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 16:02:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-25 16:02:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 16:02:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-25 16:02:19,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-25 16:02:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-25 16:02:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:02:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-25 16:02:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 16:02:19,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:19,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:19,957 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-25 16:02:19,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:19,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-25 16:02:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:20,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:20,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 16:02:20,110 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-25 16:02:20,110 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:02:20,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:02:20,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:02:20,425 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 16:02:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:20,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:02:20,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:20,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:20,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:20,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:02:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:20,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:02:20,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:20,468 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:02:20,468 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,484 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,491 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,508 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:02:20,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:02:20,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:02:20,538 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:02:20,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:02:20,542 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,565 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,577 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,587 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,597 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,625 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,625 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-25 16:02:20,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 16:02:20,665 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,689 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:20,690 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-25 16:02:20,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 16:02:20,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:02:20,817 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:20,817 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-25 16:02:20,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,870 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:20,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 16:02:20,871 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:20,924 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:20,924 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 16:02:20,925 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:20,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:20,969 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-25 16:02:21,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,026 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:21,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-25 16:02:21,027 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:21,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:21,081 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:21,082 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 16:02:21,082 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:21,116 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:21,117 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-25 16:02:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:21,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 16:02:21,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:21,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 16:02:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 16:02:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-25 16:02:21,326 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-25 16:02:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:27,704 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-25 16:02:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:02:27,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-25 16:02:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:27,705 INFO L225 Difference]: With dead ends: 74 [2019-02-25 16:02:27,705 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 16:02:27,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-25 16:02:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 16:02:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-25 16:02:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 16:02:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-25 16:02:31,334 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-25 16:02:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:31,334 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-25 16:02:31,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 16:02:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-25 16:02:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 16:02:31,334 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:31,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:31,334 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-25 16:02:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:31,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:31,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:31,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:31,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 16:02:31,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:31,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:31,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-25 16:02:31,488 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-25 16:02:31,488 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:02:31,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:02:31,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:02:31,820 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 16:02:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:31,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:02:31,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:31,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:31,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:02:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:31,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:02:31,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:31,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:02:31,861 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,871 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,883 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,898 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:02:31,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:02:31,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-25 16:02:31,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-25 16:02:31,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-25 16:02:31,932 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,954 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,966 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,976 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:31,986 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:32,014 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:32,014 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-25 16:02:32,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:02:32,064 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:32,080 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:32,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 16:02:32,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,107 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:02:32,107 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:32,124 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:32,125 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 16:02:32,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,152 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:32,153 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 16:02:32,153 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:32,171 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:32,171 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 16:02:32,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:32,197 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:32,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 16:02:32,198 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:32,214 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:32,214 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 16:02:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:32,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:32,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:32,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 16:02:32,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:32,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:02:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:02:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-25 16:02:32,295 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-25 16:02:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:39,560 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-25 16:02:39,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 16:02:39,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-25 16:02:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:39,561 INFO L225 Difference]: With dead ends: 80 [2019-02-25 16:02:39,561 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 16:02:39,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-25 16:02:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 16:02:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-25 16:02:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 16:02:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-25 16:02:46,125 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-25 16:02:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:46,125 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-25 16:02:46,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:02:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-25 16:02:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 16:02:46,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:46,125 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:46,126 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-25 16:02:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:46,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:46,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-25 16:02:46,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:46,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:46,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:02:46,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:02:46,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:46,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:02:46,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:02:46,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 16:02:46,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:02:46,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 16:02:46,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:46,279 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-25 16:02:46,281 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-25 16:02:46,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-25 16:02:46,296 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-25 16:02:46,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-25 16:02:46,309 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,326 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,335 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,345 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,354 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 16:02:46,375 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,382 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,399 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 16:02:46,399 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-25 16:02:46,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,436 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 16:02:46,437 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:02:46,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 16:02:46,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-25 16:02:46,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2019-02-25 16:02:46,493 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,520 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-02-25 16:02:46,521 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,542 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 16:02:46,542 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-25 16:02:46,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-02-25 16:02:46,571 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 16:02:46,597 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,612 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:46,612 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-25 16:02:46,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 16:02:46,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 16:02:46,667 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,684 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:46,685 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-25 16:02:46,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,726 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:46,727 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-02-25 16:02:46,727 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:46,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-02-25 16:02:46,751 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:46,767 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 16:02:46,768 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-25 16:02:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:46,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:02:46,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:46,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 16:02:46,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:46,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:02:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:02:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-25 16:02:46,887 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-25 16:02:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:53,717 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-25 16:02:53,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:02:53,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-25 16:02:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:53,718 INFO L225 Difference]: With dead ends: 71 [2019-02-25 16:02:53,718 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 16:02:53,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-02-25 16:02:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 16:02:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 16:02:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 16:02:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 16:02:53,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-25 16:02:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:53,720 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 16:02:53,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:02:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 16:02:53,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 16:02:53,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 16:02:54,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:02:54,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:02:58,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:03:32,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:03:41,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:03:42,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:03:48,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:03:49,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:04:02,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 16:04:28,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent.