java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:44:36,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:44:36,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:44:36,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:44:36,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:44:36,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:44:36,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:44:36,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:44:36,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:44:36,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:44:36,327 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:44:36,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:44:36,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:44:36,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:44:36,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:44:36,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:44:36,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:44:36,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:44:36,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:44:36,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:44:36,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:44:36,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:44:36,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:44:36,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:44:36,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:44:36,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:44:36,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:44:36,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:44:36,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:44:36,367 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:44:36,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:44:36,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:44:36,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:44:36,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:44:36,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:44:36,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:44:36,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 11:44:36,397 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:44:36,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:44:36,398 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:44:36,398 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:44:36,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:44:36,398 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:44:36,399 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:44:36,402 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:44:36,402 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:44:36,402 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:44:36,403 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:44:36,403 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:44:36,403 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:44:36,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:44:36,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:44:36,404 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:44:36,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:44:36,405 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:44:36,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:44:36,408 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:44:36,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:44:36,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:44:36,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:44:36,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:44:36,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:44:36,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:44:36,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:44:36,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:44:36,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:44:36,410 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:44:36,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:44:36,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:44:36,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:44:36,411 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:44:36,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:44:36,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:44:36,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:44:36,483 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:44:36,484 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:44:36,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-11 11:44:36,485 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-11 11:44:36,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:44:36,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:44:36,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:44:36,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:44:36,543 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:44:36,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:44:36,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:44:36,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:44:36,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:44:36,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/1) ... [2019-01-11 11:44:36,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:44:36,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:44:36,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:44:36,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:44:36,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:44:36,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:44:36,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:44:37,048 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:44:37,049 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-11 11:44:37,050 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:44:37 BoogieIcfgContainer [2019-01-11 11:44:37,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:44:37,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:44:37,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:44:37,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:44:37,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:44:36" (1/2) ... [2019-01-11 11:44:37,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc2d344 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:44:37, skipping insertion in model container [2019-01-11 11:44:37,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:44:37" (2/2) ... [2019-01-11 11:44:37,061 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-11 11:44:37,073 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:44:37,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-11 11:44:37,103 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-11 11:44:37,142 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:44:37,142 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:44:37,142 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:44:37,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:44:37,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:44:37,143 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:44:37,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:44:37,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:44:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-11 11:44:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:44:37,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:37,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:44:37,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:37,177 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-11 11:44:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:37,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:44:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:44:37,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:44:37,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:44:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:44:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:44:37,440 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-11 11:44:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:37,644 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-11 11:44:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:44:37,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:44:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:37,661 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:44:37,662 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:44:37,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:44:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:44:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-11 11:44:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:44:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-11 11:44:37,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-11 11:44:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:37,713 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-11 11:44:37,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:44:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-11 11:44:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:44:37,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:37,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:44:37,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-11 11:44:37,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:37,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:37,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:37,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:37,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:44:37,835 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-11 11:44:37,890 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:37,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:38,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:38,954 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:38,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:38,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:38,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:38,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:38,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:39,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:39,298 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:44:39,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:39,744 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 11:44:39,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:39,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:39,971 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-11 11:44:40,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,090 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-11 11:44:40,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:40,401 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 11:44:40,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:40,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:40,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:40,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:40,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:40,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:40,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:40,899 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-11 11:44:40,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:40,902 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:40,987 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,149 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,361 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:41,405 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:41,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:41,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:41,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:41,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:41,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:41,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:41,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:44:41,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:44:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:44:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:41,683 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-11 11:44:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:42,091 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-11 11:44:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:44:42,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:44:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:42,094 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:44:42,094 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:44:42,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:44:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:44:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-11 11:44:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:44:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-11 11:44:42,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-11 11:44:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:42,102 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-11 11:44:42,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:44:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-11 11:44:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:44:42,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:42,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:44:42,104 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-11 11:44:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:42,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:42,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:42,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:42,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:42,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:42,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:44:42,190 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-11 11:44:42,192 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:42,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:42,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:42,621 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:42,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:42,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:42,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:42,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:42,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:42,825 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:44:42,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:42,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:42,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:42,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:42,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,112 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-11 11:44:43,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:43,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:43,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:43,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:43,593 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:43,715 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:43,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:43,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:44:43,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:43,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:43,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:43,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:43,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:44:43,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:44:43,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:44:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:44:43,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:44:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:44:43,883 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-11 11:44:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:43,956 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-11 11:44:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:44:43,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:44:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:43,958 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:44:43,958 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 11:44:43,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:44:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 11:44:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 11:44:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:44:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-11 11:44:43,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-11 11:44:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:43,965 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-11 11:44:43,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:44:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-11 11:44:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:44:43,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:43,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:44:43,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-11 11:44:43,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:43,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:44,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:44,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:44,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:44:44,097 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-11 11:44:44,099 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:44,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:47,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:47,194 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:47,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:47,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:47,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:47,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:47,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:47,404 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-11 11:44:47,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:44:47,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:44:47,573 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-11 11:44:47,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:44:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:44:47,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:47,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:44:47,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:47,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:47,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:47,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:47,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:47,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:47,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:47,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:47,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:48,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:48,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:44:48,017 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,079 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,115 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,272 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:48,336 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 11:44:48,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:48,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:44:48,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:48,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:48,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-11 11:44:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:48,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:48,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:44:48,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:48,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:44:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:44:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:48,459 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-11 11:44:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:48,671 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-11 11:44:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:44:48,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:44:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:48,673 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:44:48,673 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 11:44:48,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 11:44:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-11 11:44:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:44:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-11 11:44:48,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-11 11:44:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:48,680 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-11 11:44:48,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:44:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-11 11:44:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:44:48,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:48,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:44:48,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-11 11:44:48,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:48,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:48,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:48,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:48,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:48,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:44:48,748 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-11 11:44:48,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:48,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:49,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:49,006 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:49,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:49,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:49,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:49,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:49,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:49,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:49,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:49,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:49,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:49,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:49,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:49,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:49,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:49,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:49,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:49,466 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,482 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,499 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:49,548 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:49,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:49,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:44:49,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:49,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:49,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:49,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:49,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:44:49,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:49,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:44:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:44:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:49,663 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-11 11:44:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:49,829 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-11 11:44:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:44:49,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:44:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:49,831 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:44:49,832 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:44:49,832 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-01-11 11:44:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:44:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-11 11:44:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:44:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-11 11:44:49,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-11 11:44:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:49,840 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-11 11:44:49,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:44:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-11 11:44:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:49,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:49,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:49,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-11 11:44:49,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:49,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:49,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:49,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:49,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:49,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:49,913 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-11 11:44:49,914 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:49,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:50,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:50,247 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:50,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:50,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:50,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:50,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:50,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:50,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:50,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:50,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:50,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:50,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:50,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:50,368 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:50,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:50,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:50,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:50,649 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,664 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,696 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:50,730 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:50,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:50,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:50,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:44:50,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:50,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:50,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:44:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:50,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:50,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:50,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:50,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:50,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:50,984 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-11 11:44:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:51,536 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-11 11:44:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:51,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:51,539 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:44:51,539 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 11:44:51,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 11:44:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-11 11:44:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:44:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-11 11:44:51,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-11 11:44:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:51,548 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-11 11:44:51,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-11 11:44:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:51,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:51,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:51,549 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-11 11:44:51,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:51,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:51,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:51,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:51,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:51,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:51,662 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-11 11:44:51,663 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:51,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:52,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:52,019 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:52,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:52,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:52,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:52,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:52,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:52,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:52,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:44:52,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:44:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:44:52,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:44:52,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:44:52,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:52,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:52,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:52,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:52,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:52,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:44:52,498 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,536 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,554 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,594 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:52,646 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:44:52,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:44:52,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:52,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:44:52,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:52,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:52,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:44:52,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:52,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:52,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:44:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:52,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:52,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:52,914 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-11 11:44:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:53,359 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-11 11:44:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:53,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:53,361 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:44:53,361 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:44:53,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:44:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 11:44:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:44:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-11 11:44:53,371 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-11 11:44:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:53,371 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-11 11:44:53,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-11 11:44:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:53,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:53,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:53,372 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-11 11:44:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:53,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:53,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:53,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:53,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:53,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:53,493 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-11 11:44:53,494 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:53,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:53,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:53,790 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:53,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:53,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:53,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:53,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:53,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:53,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:53,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:53,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:53,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:53,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:53,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:53,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:53,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:53,934 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:53,961 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:53,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:54,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:54,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:54,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:54,228 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,259 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,275 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:54,308 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:54,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:54,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:54,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:54,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:54,456 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:44:54,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:44:54,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:54,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:54,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 11:44:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:54,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:54,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:54,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:54,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:54,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:54,556 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-11 11:44:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:54,948 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-11 11:44:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:54,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:54,949 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:44:54,950 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:44:54,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:44:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:44:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 11:44:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:44:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-11 11:44:54,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-11 11:44:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:54,959 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-11 11:44:54,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-11 11:44:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:54,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:54,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:54,960 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-11 11:44:54,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:54,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:54,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:55,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:55,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:55,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:55,073 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-11 11:44:55,074 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:55,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:55,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:55,374 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:55,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:55,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:55,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:55,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:55,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:55,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:55,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:55,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:55,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:55,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:55,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:55,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:55,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:55,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:55,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:55,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:55,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:55,641 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,046 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,185 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,214 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:56,259 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:44:56,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:56,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:56,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:56,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:44:56,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:56,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:56,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:44:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:56,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:56,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:56,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:44:56,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:56,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:44:56,465 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-11 11:44:56,666 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-11 11:44:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:57,067 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-11 11:44:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:44:57,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:57,069 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:44:57,069 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:44:57,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:44:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:44:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-11 11:44:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:44:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-11 11:44:57,082 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-11 11:44:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:57,082 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-11 11:44:57,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-11 11:44:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:57,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:57,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:57,084 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-11 11:44:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:57,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:57,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:57,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:57,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:57,168 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:57,169 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-11 11:44:57,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:57,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:57,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:57,439 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:44:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:57,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:57,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:57,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:57,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:57,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:57,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:57,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:57,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:57,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:57,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:57,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:57,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:57,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:57,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:57,771 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,798 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:57,891 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:57,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:44:57,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:57,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:57,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:57,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:44:57,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:58,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:58,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:44:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:58,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:58,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:58,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:44:58,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:58,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:44:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:44:58,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:58,079 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-11 11:44:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:58,477 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-11 11:44:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:44:58,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:44:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:58,478 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:44:58,478 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:44:58,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:44:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:44:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-11 11:44:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:44:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-11 11:44:58,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-11 11:44:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:58,490 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-11 11:44:58,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:44:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-11 11:44:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:58,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:58,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:58,491 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:58,492 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-11 11:44:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:58,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:58,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:58,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:58,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:58,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:58,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:58,538 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-11 11:44:58,540 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:58,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:44:58,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:44:58,747 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:44:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:58,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:44:58,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:58,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:44:58,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:58,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:44:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:58,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:44:58,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:44:58,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:44:58,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:44:58,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:44:58,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:58,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:44:58,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:44:58,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:58,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:44:59,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:44:59,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:44:59,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:44:59,248 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,297 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:59,330 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:44:59,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:44:59,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:44:59,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:44:59,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:44:59,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 11:44:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:59,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:44:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:44:59,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:44:59,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:44:59,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:44:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:44:59,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:44:59,492 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-11 11:44:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:44:59,667 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-11 11:44:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:44:59,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:44:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:44:59,668 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:44:59,669 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:44:59,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:44:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:44:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-11 11:44:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:44:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-11 11:44:59,679 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-11 11:44:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:44:59,679 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-11 11:44:59,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:44:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-11 11:44:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:44:59,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:44:59,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:44:59,681 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:44:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:44:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-11 11:44:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:44:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:44:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:44:59,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:44:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:44:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:44:59,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:44:59,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:44:59,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:44:59,785 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-11 11:44:59,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:44:59,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:00,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:00,083 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:00,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:00,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:00,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:00,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:00,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:00,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:00,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:00,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:00,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:00,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:00,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:00,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:00,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:00,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:00,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:00,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:00,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:00,624 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,686 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,706 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,722 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:00,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:00,792 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:01,038 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-11 11:45:01,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:45:01,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:01,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:01,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:01,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:45:01,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:01,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:01,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-11 11:45:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:01,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:01,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:45:01,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:01,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:45:01,504 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-11 11:45:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:01,956 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-11 11:45:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:01,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:45:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:01,958 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:45:01,958 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:45:01,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:45:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:45:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-11 11:45:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:45:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-11 11:45:01,973 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-11 11:45:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:01,973 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-11 11:45:01,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-11 11:45:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:45:01,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:01,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:45:01,975 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-11 11:45:01,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:01,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:01,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:01,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:01,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:02,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:02,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:45:02,074 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-11 11:45:02,076 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:02,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:02,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:02,366 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:02,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:02,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:02,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:02,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:02,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:02,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:02,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:02,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:02,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:02,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:02,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:02,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:02,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:02,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:02,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:02,698 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,714 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,729 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:02,777 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:02,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:02,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:02,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:02,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:02,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:45:02,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:02,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:02,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:45:02,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-01-11 11:45:02,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:02,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:02,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:02,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:02,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:02,974 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-11 11:45:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:03,425 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-11 11:45:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:03,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:45:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:03,427 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:45:03,427 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:45:03,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:45:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 11:45:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:45:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-11 11:45:03,444 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-11 11:45:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:03,444 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-11 11:45:03,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-11 11:45:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:45:03,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:03,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:45:03,445 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-11 11:45:03,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:03,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:03,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:03,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:03,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:45:03,539 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-11 11:45:03,542 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:03,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:04,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:04,123 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:04,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:04,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:04,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:04,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:04,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:04,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:04,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:04,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:04,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:04,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:04,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:04,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:04,235 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:04,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:04,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:04,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:04,659 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,683 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,708 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,734 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,758 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:04,802 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:45:04,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:04,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:04,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:04,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:04,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:04,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:45:04,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:05,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:05,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:45:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:05,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:05,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:05,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:05,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:05,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:05,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:05,094 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-11 11:45:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:05,900 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-11 11:45:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:05,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:45:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:05,902 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:45:05,902 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:45:05,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:45:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-11 11:45:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:45:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-11 11:45:05,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-11 11:45:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:05,916 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-11 11:45:05,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-11 11:45:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:45:05,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:05,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:45:05,917 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-11 11:45:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:05,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:05,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:05,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:05,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:45:05,965 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-11 11:45:05,965 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:05,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:06,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:06,131 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:45:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:06,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:06,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:06,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:06,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:06,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:06,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:06,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:06,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:45:06,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:45:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:45:06,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:45:06,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:45:06,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,257 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:45:06,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:45:06,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:45:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:45:06,445 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,458 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:06,519 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-11 11:45:06,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:06,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:06,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:06,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:45:06,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-11 11:45:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:06,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:06,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:45:06,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:45:06,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:45:06,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:45:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:45:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:45:06,771 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-11 11:45:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:06,875 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-11 11:45:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:45:06,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:45:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:06,877 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:45:06,877 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:45:06,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:45:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:45:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-11 11:45:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 11:45:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-11 11:45:06,896 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-11 11:45:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:06,896 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-11 11:45:06,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:45:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-11 11:45:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:45:06,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:06,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:45:06,898 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-11 11:45:06,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:06,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:06,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:06,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:06,991 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:45:06,991 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-11 11:45:06,992 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:06,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:07,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:07,241 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:07,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:07,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:07,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:07,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:07,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:07,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:07,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:07,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:07,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:07,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:07,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:07,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:07,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:07,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:07,534 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,581 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,597 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:07,655 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:07,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:07,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:07,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:07,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:45:07,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:07,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:07,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:45:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:07,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:07,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:07,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:07,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:07,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:07,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:07,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:07,849 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-11 11:45:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:08,254 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-11 11:45:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:08,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:45:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:08,256 INFO L225 Difference]: With dead ends: 121 [2019-01-11 11:45:08,256 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:45:08,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:45:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-11 11:45:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:45:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 11:45:08,278 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 11:45:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:08,278 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 11:45:08,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 11:45:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:45:08,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:08,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:45:08,280 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-11 11:45:08,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:08,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:08,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:08,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:08,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:08,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:08,340 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:45:08,340 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-11 11:45:08,341 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:08,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:08,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:08,525 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:45:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:08,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:08,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:08,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:08,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:08,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:08,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:08,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:08,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:45:08,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:45:08,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:45:08,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:45:08,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:45:08,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,678 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:45:08,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:45:08,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:45:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:45:08,843 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,856 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,871 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:08,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:08,918 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:45:08,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:08,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 11:45:08,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:09,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:45:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:09,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:09,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:09,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:45:09,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:09,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:45:09,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:45:09,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:45:09,248 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-11 11:45:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:09,476 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-11 11:45:09,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:45:09,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:45:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:09,479 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:45:09,479 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:45:09,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:45:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:45:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-11 11:45:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:45:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 11:45:09,492 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 11:45:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:09,492 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 11:45:09,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:45:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 11:45:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:09,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:09,493 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 11:45:09,494 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-11 11:45:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:09,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:09,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:09,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:09,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:09,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:09,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:09,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:09,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:45:09,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:45:09,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:45:09,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:09,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:09,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:09,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:09,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:09,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:09,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:09,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:09,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:10,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:10,091 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,117 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,142 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:10,239 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:45:10,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:10,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:10,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-01-11 11:45:10,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:10,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-11 11:45:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:10,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:45:10,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:10,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:10,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-11 11:45:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:10,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:11,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:11,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:45:11,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:11,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:11,241 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-11 11:45:12,202 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-11 11:45:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:12,821 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-11 11:45:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:12,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:12,824 INFO L225 Difference]: With dead ends: 133 [2019-01-11 11:45:12,824 INFO L226 Difference]: Without dead ends: 128 [2019-01-11 11:45:12,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-11 11:45:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-11 11:45:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:45:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-11 11:45:12,843 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-11 11:45:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:12,843 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-11 11:45:12,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-11 11:45:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:12,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:12,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:12,844 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:12,844 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-11 11:45:12,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:12,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:12,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:12,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:12,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:12,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:12,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:12,937 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-11 11:45:12,939 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:12,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:13,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:13,289 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:13,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:13,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:13,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:13,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:13,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:13,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:13,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:13,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:13,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:13,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:13,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:13,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:13,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:13,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,709 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:13,757 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:13,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:45:13,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:13,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:13,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:13,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:45:13,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:13,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:13,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:45:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:13,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:13,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:13,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:13,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:13,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:13,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:13,984 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-11 11:45:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:14,384 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-11 11:45:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:14,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:45:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:14,386 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:45:14,386 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 11:45:14,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 11:45:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-11 11:45:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 11:45:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-11 11:45:14,406 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-11 11:45:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:14,407 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-11 11:45:14,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-11 11:45:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:14,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:14,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:14,408 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-11 11:45:14,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:14,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:14,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:14,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:14,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:14,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:14,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:14,609 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-11 11:45:14,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:14,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:14,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:14,967 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:14,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:14,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:14,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:14,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:14,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:14,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:15,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:15,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:15,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:15,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:15,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:15,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:15,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:15,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:15,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:15,410 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,448 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,468 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,483 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,496 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,508 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:15,555 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:15,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:45:15,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:15,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:15,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-11 11:45:15,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:15,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:45:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:15,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:15,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:45:15,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:15,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:15,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:45:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:15,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:15,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:15,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:15,892 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-11 11:45:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:17,523 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-11 11:45:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:17,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:17,525 INFO L225 Difference]: With dead ends: 149 [2019-01-11 11:45:17,526 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:45:17,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:45:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:45:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-11 11:45:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:45:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-11 11:45:17,547 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-11 11:45:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:17,547 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-11 11:45:17,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-11 11:45:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:17,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:17,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:17,548 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-11 11:45:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:17,694 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:45:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:18,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:18,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:18,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:18,092 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-11 11:45:18,094 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:18,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:18,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:18,598 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:18,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:18,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:18,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:18,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:18,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:18,816 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:45:18,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:18,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:18,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:18,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:18,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:18,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:18,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:18,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:19,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,096 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-11 11:45:19,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:19,232 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-01-11 11:45:19,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:19,234 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:19,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:19,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:19,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:19,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,568 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,605 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:19,640 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:19,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:45:19,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:19,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:19,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:45:19,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:19,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:45:19,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:19,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:19,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:45:19,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:19,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:19,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:45:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:19,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:19,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:19,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:19,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:19,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:19,936 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-11 11:45:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:20,483 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-11 11:45:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:20,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:20,486 INFO L225 Difference]: With dead ends: 138 [2019-01-11 11:45:20,486 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 11:45:20,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 11:45:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-11 11:45:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:45:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-11 11:45:20,508 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-11 11:45:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:20,508 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-11 11:45:20,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-11 11:45:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:20,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:20,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:20,509 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-11 11:45:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:20,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:20,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-01-11 11:45:20,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:20,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:20,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:20,649 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-11 11:45:20,649 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:20,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:21,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:21,043 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:21,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:21,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:21,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:21,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:21,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:21,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:21,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:21,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:21,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:21,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:21,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:21,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:21,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:21,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:21,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:21,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:21,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:21,480 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,515 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,533 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,548 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,561 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:21,618 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:21,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:45:21,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:21,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:21,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,719 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:21,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:45:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:21,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:45:21,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:21,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:45:21,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:21,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:21,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:45:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:21,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:21,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:21,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:45:21,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:21,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:21,930 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-11 11:45:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:22,505 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-11 11:45:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:22,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:22,511 INFO L225 Difference]: With dead ends: 152 [2019-01-11 11:45:22,511 INFO L226 Difference]: Without dead ends: 151 [2019-01-11 11:45:22,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:45:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-11 11:45:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-11 11:45:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 11:45:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-11 11:45:22,550 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-11 11:45:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:22,550 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-11 11:45:22,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-11 11:45:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:22,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:22,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:22,552 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-11 11:45:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:22,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:22,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:22,928 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-11 11:45:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:22,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:22,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:22,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:22,986 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-11 11:45:22,987 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:22,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:23,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:23,482 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:23,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:23,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:23,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:23,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:23,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:23,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:23,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:23,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:23,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:23,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:23,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:23,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:23,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:23,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:24,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:24,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:24,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:24,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:24,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:24,033 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,068 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,089 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,105 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:24,175 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:24,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:45:24,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:24,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:24,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:24,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:45:24,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:24,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 11:45:24,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:24,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:24,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 11:45:24,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:24,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:24,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-11 11:45:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:25,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:26,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:26,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:26,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:26,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:26,012 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-11 11:45:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:26,734 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-11 11:45:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:26,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:26,736 INFO L225 Difference]: With dead ends: 141 [2019-01-11 11:45:26,737 INFO L226 Difference]: Without dead ends: 140 [2019-01-11 11:45:26,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-11 11:45:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-11 11:45:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:45:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-11 11:45:26,771 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-11 11:45:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:26,771 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-11 11:45:26,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-11 11:45:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:26,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:26,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:26,773 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-11 11:45:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:26,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:26,974 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-11 11:45:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:26,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:26,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:26,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:26,991 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-11 11:45:26,995 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:26,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:27,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:27,407 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:27,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:27,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:27,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:27,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:27,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:27,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:27,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:27,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:27,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:27,511 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:27,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:27,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:27,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:27,755 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,771 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,787 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,803 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:27,836 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:27,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:45:27,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:27,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:27,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:27,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:45:27,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:27,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:27,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 11:45:27,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:27,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:45:27,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:28,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:28,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:45:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:28,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:28,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:28,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:45:28,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:28,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:28,087 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-11 11:45:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:28,577 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-11 11:45:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:45:28,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:28,580 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:45:28,580 INFO L226 Difference]: Without dead ends: 162 [2019-01-11 11:45:28,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:45:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-11 11:45:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-11 11:45:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 11:45:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-11 11:45:28,605 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-11 11:45:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:28,605 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-11 11:45:28,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-11 11:45:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:28,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:28,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:28,606 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-11 11:45:28,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:28,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:28,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:28,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:28,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:28,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:28,707 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-11 11:45:28,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:28,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:29,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:29,073 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:29,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:29,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:29,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:29,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:29,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:29,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:29,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:29,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:29,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:29,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:29,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:29,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:29,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:29,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:29,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:29,513 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,599 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,621 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,644 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:29,706 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:29,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:45:29,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:29,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:29,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:45:29,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:29,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:45:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,926 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:29,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:29,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:45:29,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:29,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:29,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:45:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:29,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:30,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:30,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:30,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:30,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:30,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:30,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:30,056 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-11 11:45:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:30,732 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-11 11:45:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:30,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:30,735 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:45:30,735 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 11:45:30,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 11:45:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-11 11:45:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 11:45:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-11 11:45:30,762 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-11 11:45:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-11 11:45:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-11 11:45:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:30,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:30,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:30,763 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-11 11:45:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:30,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:30,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:30,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:30,871 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-11 11:45:30,872 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:30,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:31,218 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:31,218 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:31,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:31,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:31,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:31,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:31,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:31,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:31,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:31,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:31,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:31,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:31,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:31,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:31,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:31,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:31,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:31,483 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,508 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,527 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,543 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,556 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,566 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:31,598 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:45:31,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:31,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:31,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:45:31,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:31,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:45:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,773 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:31,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:31,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:45:31,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:31,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:31,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:45:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:31,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:31,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:31,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:31,884 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-11 11:45:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:32,429 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-11 11:45:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:32,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:32,432 INFO L225 Difference]: With dead ends: 165 [2019-01-11 11:45:32,432 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:45:32,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:45:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-11 11:45:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-11 11:45:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-11 11:45:32,451 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-11 11:45:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:32,452 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-11 11:45:32,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-11 11:45:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:32,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:32,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:32,453 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-11 11:45:32,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:32,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:32,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:45:32,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:32,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:32,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:32,491 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-11 11:45:32,492 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:32,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:32,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:32,751 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:32,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:32,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:32,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:32,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:32,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:32,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:32,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:32,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:32,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:32,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:32,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:32,849 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,877 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:32,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:33,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:33,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:33,088 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,105 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,120 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:33,168 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:33,631 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-11 11:45:33,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:33,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:33,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:33,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:33,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:33,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:45:33,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:33,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:33,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:45:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:33,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:45:33,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:33,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:45:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:45:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:45:33,783 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-11 11:45:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:34,071 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-11 11:45:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:34,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 11:45:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:34,074 INFO L225 Difference]: With dead ends: 158 [2019-01-11 11:45:34,074 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 11:45:34,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:45:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 11:45:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-11 11:45:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 11:45:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-11 11:45:34,095 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-11 11:45:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:34,095 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-11 11:45:34,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:45:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-11 11:45:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:34,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:34,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:34,096 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-11 11:45:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:34,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:34,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:34,415 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-11 11:45:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:34,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:34,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:34,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:34,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:34,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:34,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:34,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:45:34,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:45:34,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:45:34,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:34,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:34,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:34,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:34,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:34,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:34,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:34,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,757 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:34,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:34,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:34,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:34,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:34,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:34,900 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,955 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:34,991 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,012 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,037 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:35,084 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:45:35,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:35,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:35,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:45:35,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:35,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:45:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:35,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:35,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:45:35,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:35,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:35,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:45:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:35,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:35,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:35,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:45:35,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:35,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:45:35,387 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-11 11:45:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:36,094 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-11 11:45:36,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:45:36,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:36,097 INFO L225 Difference]: With dead ends: 241 [2019-01-11 11:45:36,098 INFO L226 Difference]: Without dead ends: 235 [2019-01-11 11:45:36,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:45:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-11 11:45:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-11 11:45:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 11:45:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-11 11:45:36,136 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-11 11:45:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:36,136 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-11 11:45:36,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-11 11:45:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:36,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:36,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:36,138 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-11 11:45:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:36,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:36,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:45:36,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:36,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:36,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:36,430 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-11 11:45:36,430 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:36,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:36,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:36,704 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:36,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:36,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:36,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:36,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:36,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:36,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:36,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:36,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:36,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:36,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:36,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:36,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,852 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:36,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:36,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:36,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:37,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:37,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:37,090 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:37,107 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:37,122 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:37,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:37,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:37,170 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:37,405 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:45:37,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:45:37,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:37,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:45:37,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-11 11:45:37,800 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-11 11:45:37,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,808 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:37,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-11 11:45:37,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:37,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:37,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 11:45:37,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 11:45:38,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:45:38,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-11 11:45:38,829 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-11 11:45:38,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-01-11 11:45:38,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:38,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:38,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:38,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:38,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:38,937 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-11 11:45:39,436 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 11:45:39,962 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-11 11:45:40,375 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-11 11:45:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:40,682 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-11 11:45:40,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:40,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:45:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:40,686 INFO L225 Difference]: With dead ends: 208 [2019-01-11 11:45:40,686 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:45:40,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:45:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-11 11:45:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:45:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-11 11:45:40,730 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-11 11:45:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:40,730 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-11 11:45:40,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-11 11:45:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:40,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:40,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:40,732 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-11 11:45:40,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:40,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:40,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:40,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:40,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:40,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:40,882 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-11 11:45:40,883 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:40,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:41,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:41,342 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:41,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:41,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:41,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:41,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:41,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:41,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:41,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:41,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:41,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:41,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:41,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:41,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:41,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:41,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:41,615 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,642 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,661 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:41,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:41,734 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:41,971 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:45:41,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:41,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:45:41,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:42,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 11:45:42,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 11:45:42,318 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 11:45:42,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 11:45:42,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:45:42,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-11 11:45:42,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:42,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:45:42,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-11 11:45:42,834 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-11 11:45:42,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:42,894 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:42,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-11 11:45:42,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:45:43,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,223 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:43,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 11:45:43,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:43,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:43,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-11 11:45:43,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:43,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:45:43,552 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-11 11:45:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:43,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:43,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:43,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:45:43,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:43,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:43,729 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-11 11:45:44,327 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-11 11:45:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:44,863 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-11 11:45:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:45:44,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:44,869 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:45:44,869 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:45:44,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:45:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:45:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-11 11:45:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 11:45:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-11 11:45:44,916 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-11 11:45:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:44,916 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-11 11:45:44,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-11 11:45:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:44,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:44,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:44,918 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-11 11:45:44,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:44,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:44,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:44,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:45:45,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:45:45,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:45:45,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:45:45,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:45:45,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:45:45,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:45:45,070 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-11 11:45:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:45,162 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-11 11:45:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:45:45,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:45:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:45,166 INFO L225 Difference]: With dead ends: 201 [2019-01-11 11:45:45,166 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 11:45:45,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:45:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 11:45:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-11 11:45:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 11:45:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-11 11:45:45,210 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-11 11:45:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:45,210 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-11 11:45:45,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:45:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-11 11:45:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:45,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:45,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:45,211 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-11 11:45:45,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:45,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:45,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:45:45,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:45,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:45,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:45,373 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-11 11:45:45,374 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:45,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:45,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:45,608 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:45,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:45,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:45,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:45,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:45,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:45,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:45,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:45,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:45,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:45,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:45,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:45,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:45,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:45,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:45,906 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,933 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:45,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:46,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:46,025 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:46,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:46,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:46,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:46,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:46,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:46,118 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:46,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:45:46,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:46,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:46,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:45:46,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-01-11 11:45:46,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:46,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:46,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:46,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:46,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:46,210 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-11 11:45:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:46,527 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-11 11:45:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:46,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:45:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:46,530 INFO L225 Difference]: With dead ends: 208 [2019-01-11 11:45:46,530 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:45:46,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:45:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-11 11:45:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 11:45:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-11 11:45:46,565 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-11 11:45:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:46,565 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-11 11:45:46,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-11 11:45:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:46,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:46,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:46,566 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-11 11:45:46,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:46,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:46,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:46,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:46,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:46,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:46,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:46,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:46,829 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-11 11:45:46,830 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:46,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:47,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:47,201 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:47,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:47,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:47,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:47,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:47,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:47,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:47,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:45:47,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:45:47,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:45:47,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:45:47,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:47,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:45:47,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:45:47,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:45:47,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:45:47,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:45:47,494 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,517 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,549 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,560 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,571 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:47,600 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:45:47,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 11:45:47,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:47,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:45:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:47,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-11 11:45:47,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:47,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:47,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 11:45:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:47,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:47,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:47,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:47,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:47,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:47,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:47,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:47,782 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-11 11:45:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:48,104 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-11 11:45:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:48,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:45:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:48,108 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:45:48,108 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 11:45:48,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 11:45:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-11 11:45:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 11:45:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-11 11:45:48,140 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-11 11:45:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:48,140 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-11 11:45:48,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-11 11:45:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:48,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:48,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:48,141 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-11 11:45:48,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:48,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:48,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:48,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:48,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:45:48,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:45:48,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:48,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:48,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:45:48,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:45:48,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:45:48,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:45:48,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:48,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:48,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:48,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:48,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:48,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:48,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:48,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:48,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:48,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:48,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:48,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:48,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:48,718 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,965 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:48,986 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,002 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,015 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,027 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:49,073 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:49,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:45:49,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:49,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:49,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:45:49,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:49,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:45:49,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:49,279 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:49,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-11 11:45:49,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:49,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:49,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:45:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:49,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:49,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:49,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:49,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:49,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:49,429 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-11 11:45:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:50,933 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-11 11:45:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:50,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:50,937 INFO L225 Difference]: With dead ends: 242 [2019-01-11 11:45:50,937 INFO L226 Difference]: Without dead ends: 240 [2019-01-11 11:45:50,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-11 11:45:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-11 11:45:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 11:45:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-11 11:45:50,970 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-11 11:45:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:50,971 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-11 11:45:50,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-11 11:45:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:50,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:50,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:50,972 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-11 11:45:50,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:50,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:45:50,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:50,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:51,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:51,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:51,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:51,122 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-11 11:45:51,123 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:51,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:51,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:51,436 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:51,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:51,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:51,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:51,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:51,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:51,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:51,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:51,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:51,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:45:51,528 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:45:51,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:45:51,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:45:51,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:45:51,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:45:51,885 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,910 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:51,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:52,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:52,032 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:45:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:45:52,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:52,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:52,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:45:52,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:45:52,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:52,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:52,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 11:45:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:52,259 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:52,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:45:52,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:52,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:52,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:45:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:52,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:52,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:52,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:52,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:52,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:52,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:52,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:52,399 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-11 11:45:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:53,009 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-11 11:45:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:53,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:53,013 INFO L225 Difference]: With dead ends: 249 [2019-01-11 11:45:53,013 INFO L226 Difference]: Without dead ends: 247 [2019-01-11 11:45:53,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:45:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-11 11:45:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-11 11:45:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 11:45:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-11 11:45:53,048 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-11 11:45:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:53,048 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-11 11:45:53,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-11 11:45:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:53,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:53,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:53,050 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-11 11:45:53,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:53,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:53,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:53,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:53,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:53,160 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:53,160 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-11 11:45:53,163 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:53,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:53,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:53,439 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:45:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:53,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:53,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:53,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:53,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:53,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:53,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:53,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:45:53,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:45:53,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:45:53,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:45:53,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:45:53,532 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,561 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:45:53,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:45:53,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:45:53,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:45:53,786 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,851 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:53,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:53,916 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:45:53,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:53,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:45:53,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:54,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:54,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:45:54,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:45:54,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:54,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:54,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:45:54,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:54,104 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:54,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:45:54,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:54,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:54,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:45:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:54,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:45:54,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:54,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:45:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:45:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:45:54,260 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-11 11:45:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:54,850 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-11 11:45:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:45:54,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:45:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:54,853 INFO L225 Difference]: With dead ends: 260 [2019-01-11 11:45:54,853 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 11:45:54,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:45:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 11:45:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-11 11:45:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:45:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 11:45:54,892 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 11:45:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:54,892 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 11:45:54,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:45:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 11:45:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:54,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:54,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:54,893 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-11 11:45:54,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:54,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:54,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:54,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:54,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:55,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:55,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:55,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:55,011 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-11 11:45:55,011 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:55,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:55,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:55,231 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:55,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:55,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:55,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:55,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:55,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:55,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:55,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:45:55,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:45:55,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:45:55,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:45:55,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:45:55,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,357 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:45:55,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:45:55,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:45:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:45:55,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:45:55,632 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,657 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,681 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,706 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:55,777 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:45:55,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:45:55,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:55,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:45:55,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:55,877 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:55,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-01-11 11:45:55,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:55,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:55,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-11 11:45:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:55,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:55,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:55,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:55,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:55,982 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 11:45:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:45:56,299 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-11 11:45:56,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:45:56,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:45:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:45:56,303 INFO L225 Difference]: With dead ends: 244 [2019-01-11 11:45:56,303 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:45:56,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:45:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:45:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-11 11:45:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:45:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 11:45:56,338 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 11:45:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:45:56,338 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 11:45:56,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:45:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 11:45:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:45:56,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:45:56,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:45:56,340 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:45:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-11 11:45:56,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:45:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:56,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:45:56,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:45:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:56,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:56,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:45:56,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:45:56,384 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-11 11:45:56,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:45:56,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:45:56,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:45:56,628 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:45:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:45:56,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:45:56,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:45:56,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:45:56,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:45:56,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:45:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:45:56,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:45:56,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:45:56,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:45:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:45:56,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:45:56,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:45:56,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:45:56,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:45:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:45:56,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:45:56,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:56,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:45:56,933 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,961 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:56,976 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:45:57,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:45:57,007 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:45:57,217 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 11:45:57,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:45:57,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 11:45:57,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 11:45:57,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-11 11:45:57,764 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 82 [2019-01-11 11:45:57,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 11:45:57,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:57,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-11 11:45:57,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:57,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:45:57,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:45:57,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 80 [2019-01-11 11:45:57,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:45:58,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:45:58,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:178, output treesize:126 [2019-01-11 11:45:58,181 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-11 11:45:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:58,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:45:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:45:58,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:45:58,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:45:58,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:45:58,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:45:58,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:45:58,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:45:58,242 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 11:45:58,679 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 11:45:59,067 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-11 11:46:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:09,704 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-11 11:46:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:46:09,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:46:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:09,709 INFO L225 Difference]: With dead ends: 273 [2019-01-11 11:46:09,709 INFO L226 Difference]: Without dead ends: 272 [2019-01-11 11:46:09,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:46:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-11 11:46:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-11 11:46:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-11 11:46:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-11 11:46:09,744 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-11 11:46:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:09,744 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-11 11:46:09,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-11 11:46:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:46:09,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:09,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:46:09,745 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-11 11:46:09,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:09,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:09,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:09,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:09,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:09,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:09,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:09,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:09,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:09,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:46:09,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:46:09,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:46:09,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:09,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:09,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:09,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:09,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:09,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:09,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:09,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:09,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:09,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:10,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:10,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:10,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:10,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:10,321 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,347 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,373 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,399 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:10,475 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:10,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:46:10,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:10,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:10,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:46:10,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:10,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 11:46:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:10,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:46:10,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:10,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:10,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:46:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:10,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:10,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:46:10,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:10,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:46:10,891 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-11 11:46:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:11,628 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-11 11:46:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:46:11,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:46:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:11,633 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:46:11,633 INFO L226 Difference]: Without dead ends: 273 [2019-01-11 11:46:11,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-11 11:46:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-11 11:46:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:46:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 11:46:11,674 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 11:46:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:11,674 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 11:46:11,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 11:46:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:46:11,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:11,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:46:11,675 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:11,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-11 11:46:11,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:11,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:11,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:11,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:11,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:11,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:46:11,834 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-11 11:46:11,835 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:11,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:13,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:13,396 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:46:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:13,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:13,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:13,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:13,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:13,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:13,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:46:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:46:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:46:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:46:13,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:46:13,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:13,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:13,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:13,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:13,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:13,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:46:13,801 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,833 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,852 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,877 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,889 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:13,932 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 11:46:13,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:13,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:46:13,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:13,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:13,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-11 11:46:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:14,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:46:14,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:14,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:46:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:46:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:46:14,044 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-11 11:46:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:14,249 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-11 11:46:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:46:14,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 11:46:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:14,252 INFO L225 Difference]: With dead ends: 242 [2019-01-11 11:46:14,252 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 11:46:14,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:46:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 11:46:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-11 11:46:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:46:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 11:46:14,290 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 11:46:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:14,290 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 11:46:14,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:46:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 11:46:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:46:14,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:14,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:46:14,292 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-11 11:46:14,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:14,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:14,500 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-11 11:46:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:14,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:14,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:14,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:46:14,537 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-11 11:46:14,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:14,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:15,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:15,254 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:15,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:15,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:15,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:15,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:15,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:15,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:15,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:15,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:15,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:15,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:15,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:15,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:15,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:15,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:15,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:15,728 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,779 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,797 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,848 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:15,894 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:15,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:15,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:46:15,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:15,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:15,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:16,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:46:16,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:16,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:16,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:46:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:16,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:16,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-01-11 11:46:16,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:16,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:16,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 11:46:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:16,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:16,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:16,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:16,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:16,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:16,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:16,250 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-11 11:46:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:16,901 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-11 11:46:16,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:16,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:46:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:16,905 INFO L225 Difference]: With dead ends: 276 [2019-01-11 11:46:16,905 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:46:16,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:46:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-11 11:46:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-11 11:46:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-11 11:46:16,954 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-11 11:46:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:16,954 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-11 11:46:16,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-11 11:46:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:46:16,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:16,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:46:16,955 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-11 11:46:16,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:16,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:16,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:17,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:17,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:17,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:46:17,031 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-11 11:46:17,031 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:17,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:17,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:17,253 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:17,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:17,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:17,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:17,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:17,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:17,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:46:17,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:46:17,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:46:17,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:46:17,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:17,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:17,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:17,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:17,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:17,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:46:17,519 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,545 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,566 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:17,641 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:46:17,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:46:17,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:17,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:46:17,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:17,821 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-11 11:46:17,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:46:17,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:17,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:17,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:46:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:17,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:17,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:17,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:46:17,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:17,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:46:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:46:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:17,911 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-11 11:46:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:18,326 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-11 11:46:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:18,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:46:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:18,331 INFO L225 Difference]: With dead ends: 288 [2019-01-11 11:46:18,331 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 11:46:18,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:46:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 11:46:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-11 11:46:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-11 11:46:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-11 11:46:18,383 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-11 11:46:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:18,384 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-11 11:46:18,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-11 11:46:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:46:18,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:18,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:46:18,385 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-11 11:46:18,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:18,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:18,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:18,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:18,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:18,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:18,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:18,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:46:18,538 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-11 11:46:18,540 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:18,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:18,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:18,751 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:18,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:18,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:18,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:18,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:18,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:18,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:18,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:18,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:18,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:18,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:46:18,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:18,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:46:18,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:46:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:46:19,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:46:19,049 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,065 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,078 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,094 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:19,127 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:46:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:46:19,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:19,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:19,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:46:19,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:19,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:46:19,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:19,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:19,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-11 11:46:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:19,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:19,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:46:19,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:19,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:46:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:46:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:46:19,366 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-11 11:46:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:19,762 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-11 11:46:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:46:19,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:46:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:19,767 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:46:19,767 INFO L226 Difference]: Without dead ends: 318 [2019-01-11 11:46:19,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-11 11:46:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-11 11:46:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:46:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 11:46:19,821 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-11 11:46:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:19,821 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 11:46:19,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 11:46:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:19,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:19,822 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:46:19,823 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-11 11:46:19,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:19,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:19,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:19,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:19,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:19,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:19,993 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-11 11:46:19,994 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:19,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:20,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:20,156 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:46:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:20,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:20,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:20,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:20,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:20,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:20,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:46:20,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:46:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:46:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:46:20,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:20,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:20,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:20,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:20,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:20,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:46:20,424 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,449 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,468 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,494 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:20,536 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:46:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 11:46:20,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:20,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:46:20,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:20,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-11 11:46:20,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:20,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:20,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-11 11:46:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:20,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:20,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-01-11 11:46:20,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:20,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:46:20,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:20,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:46:20,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:46:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:46:20,754 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-11 11:46:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:21,005 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-11 11:46:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:46:21,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 11:46:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:21,008 INFO L225 Difference]: With dead ends: 290 [2019-01-11 11:46:21,008 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 11:46:21,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 11:46:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-11 11:46:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:46:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 11:46:21,061 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-11 11:46:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:21,061 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 11:46:21,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:46:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 11:46:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:21,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:21,062 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 11:46:21,063 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-11 11:46:21,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:21,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:21,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:21,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:21,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:21,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:21,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:21,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:21,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:46:21,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:46:21,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:46:21,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:21,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:21,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:21,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:21,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:21,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:46:21,294 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:46:21,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:46:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:46:21,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:46:21,547 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,562 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,594 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:21,628 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 11:46:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:46:21,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:21,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:46:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:46:21,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:21,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:46:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:46:21,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:21,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:46:21,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:21,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:46:21,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:21,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:21,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:46:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:21,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:21,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:21,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:46:21,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:21,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:46:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:46:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:46:21,965 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-11 11:46:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:22,610 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-11 11:46:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:46:22,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:46:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:22,615 INFO L225 Difference]: With dead ends: 423 [2019-01-11 11:46:22,615 INFO L226 Difference]: Without dead ends: 421 [2019-01-11 11:46:22,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-11 11:46:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-11 11:46:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 11:46:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-11 11:46:22,761 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-11 11:46:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:22,762 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-11 11:46:22,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:46:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-11 11:46:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:22,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:22,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:22,764 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-11 11:46:22,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:22,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:22,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:22,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:22,929 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:46:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:23,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:23,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:23,052 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:23,052 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-11 11:46:23,053 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:23,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:23,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:23,350 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:23,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:23,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:23,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:23,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:23,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:23,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:23,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:23,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:23,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:23,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:23,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,491 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:23,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:23,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:23,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:23,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:23,846 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,872 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,897 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,923 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,950 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:23,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:23,999 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:24,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:46:24,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:24,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:24,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:24,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:46:24,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:24,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:24,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:46:24,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:24,224 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:24,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:46:24,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:24,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:24,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 11:46:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:24,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:24,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:24,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:24,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:24,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:24,452 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-11 11:46:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:25,068 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-11 11:46:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:25,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:25,074 INFO L225 Difference]: With dead ends: 368 [2019-01-11 11:46:25,074 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:46:25,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:46:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-11 11:46:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 11:46:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-11 11:46:25,141 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-11 11:46:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:25,142 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-11 11:46:25,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-11 11:46:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:25,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:25,143 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:46:25,143 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:25,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-11 11:46:25,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:25,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:25,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:25,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:25,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:25,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:25,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:25,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:25,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:46:25,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:46:25,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:46:25,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:25,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:25,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:25,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:25,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:25,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:25,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:25,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:25,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:25,707 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,732 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,758 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:25,871 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:25,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:46:25,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:25,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:25,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:25,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:25,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:46:26,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:26,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:26,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:46:26,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:46:26,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:26,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:26,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:46:26,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:26,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-11 11:46:26,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:26,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:26,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-11 11:46:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:26,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:26,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:46:26,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:26,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:46:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:46:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:26,399 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-11 11:46:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:27,179 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-11 11:46:27,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:46:27,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:46:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:27,185 INFO L225 Difference]: With dead ends: 407 [2019-01-11 11:46:27,185 INFO L226 Difference]: Without dead ends: 401 [2019-01-11 11:46:27,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:46:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-11 11:46:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-11 11:46:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 11:46:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-11 11:46:27,265 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-11 11:46:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:27,265 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-11 11:46:27,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:46:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-11 11:46:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:27,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:27,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:27,267 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-11 11:46:27,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:27,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:27,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:27,599 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-11 11:46:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:27,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:27,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:27,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:27,722 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-11 11:46:27,722 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:27,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:28,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:28,101 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:46:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:28,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:28,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:28,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:28,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:28,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:28,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:28,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:28,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:28,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:28,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:28,228 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:28,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:28,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:28,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:28,589 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,616 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,641 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,668 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,694 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:28,742 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:28,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:46:28,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:28,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:28,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:46:28,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:28,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:28,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:46:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,950 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:28,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:28,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:46:28,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:29,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:29,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:46:29,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:29,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:29,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:46:29,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:29,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:29,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:46:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:29,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:29,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:29,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:46:29,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:29,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:46:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:46:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:29,181 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-11 11:46:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:30,257 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-11 11:46:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:46:30,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:46:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:30,264 INFO L225 Difference]: With dead ends: 645 [2019-01-11 11:46:30,264 INFO L226 Difference]: Without dead ends: 643 [2019-01-11 11:46:30,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:46:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-11 11:46:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-11 11:46:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-11 11:46:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-11 11:46:30,375 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-11 11:46:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:30,375 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-11 11:46:30,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:46:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-11 11:46:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:30,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:30,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:30,377 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-11 11:46:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:30,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:30,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:30,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:30,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:30,468 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-11 11:46:30,468 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:30,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:30,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:30,706 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:30,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:30,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:30,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:30,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:30,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:30,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:30,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:30,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:30,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:30,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:30,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:46:30,787 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,813 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:30,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:46:30,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:46:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:30,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:46:31,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:46:31,027 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:31,050 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:31,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:31,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:31,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:31,123 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:46:31,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 11:46:31,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:31,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:31,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:46:31,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:31,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:46:31,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:31,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:31,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-11 11:46:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:31,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:31,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:31,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:46:31,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:31,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:46:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:46:31,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:31,499 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-11 11:46:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:32,045 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-11 11:46:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:46:32,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:46:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:32,051 INFO L225 Difference]: With dead ends: 527 [2019-01-11 11:46:32,051 INFO L226 Difference]: Without dead ends: 524 [2019-01-11 11:46:32,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:46:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-11 11:46:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-11 11:46:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-11 11:46:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-11 11:46:32,174 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-11 11:46:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:32,174 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-11 11:46:32,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:46:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-11 11:46:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:32,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:32,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:32,175 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-11 11:46:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:32,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:32,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:32,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:32,253 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:32,253 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-11 11:46:32,254 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:32,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:32,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:32,533 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:32,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:32,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:32,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:32,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:32,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:32,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:32,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:32,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:32,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:32,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:32,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:46:32,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,654 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:46:32,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:46:32,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:46:32,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:32,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:46:32,875 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,890 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,906 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:32,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:32,954 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:46:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:46:33,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:33,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:33,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:46:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:46:33,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:33,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:33,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:46:33,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:33,134 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:33,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:46:33,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:33,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:33,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:46:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:33,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:33,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:33,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:33,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:33,248 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-11 11:46:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:33,866 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-11 11:46:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:33,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:33,873 INFO L225 Difference]: With dead ends: 534 [2019-01-11 11:46:33,874 INFO L226 Difference]: Without dead ends: 533 [2019-01-11 11:46:33,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-11 11:46:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-11 11:46:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-11 11:46:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-11 11:46:33,996 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-11 11:46:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:33,996 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-11 11:46:33,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-11 11:46:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:33,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:33,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:33,998 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-11 11:46:33,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:33,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:33,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:33,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:33,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:34,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:34,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:34,060 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-11 11:46:34,062 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:34,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:34,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:34,365 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:34,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:34,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:34,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:34,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:34,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:34,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:34,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:34,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:34,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:34,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:34,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:46:34,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:46:34,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:46:34,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:46:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:46:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:46:34,759 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,782 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,806 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,829 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:34,898 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:46:34,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:46:34,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:34,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:34,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:46:34,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:34,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 11:46:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:35,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:35,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:46:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,084 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:35,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-11 11:46:35,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:35,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:35,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 11:46:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:35,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:35,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:35,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:35,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:35,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:35,214 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-11 11:46:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:35,827 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-11 11:46:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:35,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:35,833 INFO L225 Difference]: With dead ends: 543 [2019-01-11 11:46:35,833 INFO L226 Difference]: Without dead ends: 542 [2019-01-11 11:46:35,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-11 11:46:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-11 11:46:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 11:46:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-11 11:46:35,976 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-11 11:46:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:35,976 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-11 11:46:35,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-11 11:46:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:35,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:35,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:35,978 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-11 11:46:35,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:35,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:35,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:35,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:36,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:36,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:36,069 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:36,069 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-11 11:46:36,069 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:36,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:36,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:36,348 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:36,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:36,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:36,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:36,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:36,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:36,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:36,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:36,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:46:36,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:46:36,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:46:36,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:46:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:46:36,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:46:36,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,771 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,795 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,820 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:36,891 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:46:36,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:46:36,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:36,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:36,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:46:36,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:36,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 11:46:37,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:37,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:37,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:46:37,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:37,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:37,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:46:37,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:37,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:37,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 11:46:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:37,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:37,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:37,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:37,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:37,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:37,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:37,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:37,227 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-11 11:46:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:37,897 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-11 11:46:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:37,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:37,902 INFO L225 Difference]: With dead ends: 537 [2019-01-11 11:46:37,902 INFO L226 Difference]: Without dead ends: 536 [2019-01-11 11:46:37,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-11 11:46:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-11 11:46:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-11 11:46:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-11 11:46:38,023 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-11 11:46:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:38,023 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-11 11:46:38,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-11 11:46:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:38,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:38,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:38,024 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:38,024 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-11 11:46:38,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:38,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:38,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:38,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-01-11 11:46:38,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:38,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:38,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:38,180 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-11 11:46:38,181 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:38,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:38,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:38,503 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:38,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:38,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:38,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:38,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:38,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:38,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:38,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:38,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:38,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:38,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:38,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:38,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:38,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:38,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:38,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:39,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:39,027 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,053 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,079 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,105 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,132 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:39,178 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:39,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:46:39,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:39,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:39,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,366 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:39,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:46:39,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:39,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 11:46:39,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:39,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:46:39,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:39,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:39,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 11:46:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:39,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:39,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:39,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:39,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:39,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:39,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:39,585 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-11 11:46:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:40,280 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-11 11:46:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:46:40,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:40,285 INFO L225 Difference]: With dead ends: 588 [2019-01-11 11:46:40,285 INFO L226 Difference]: Without dead ends: 587 [2019-01-11 11:46:40,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:46:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-11 11:46:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-11 11:46:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-11 11:46:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-11 11:46:40,423 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-11 11:46:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:40,423 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-11 11:46:40,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-11 11:46:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:40,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:40,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:40,425 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-11 11:46:40,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:40,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:40,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:40,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:40,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:40,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:40,467 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-11 11:46:40,468 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:40,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:40,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:40,842 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:40,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:40,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:40,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:40,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:40,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:40,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:40,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:40,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:40,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,131 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-11 11:46:41,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:41,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,255 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-11 11:46:41,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:41,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,402 INFO L303 Elim1Store]: Index analysis took 144 ms [2019-01-11 11:46:41,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:46:41,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:46:41,737 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 11:46:41,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:46:41,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:46:41,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:46:41,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:41,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:46:41,911 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,934 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,959 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:41,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:42,008 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:42,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:42,052 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:46:42,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:46:42,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:42,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:42,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:46:42,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:42,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:42,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-11 11:46:42,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:42,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:42,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-11 11:46:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:42,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:42,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:42,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:46:42,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:42,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:46:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:46:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:42,264 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-11 11:46:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:42,748 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-11 11:46:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:46:42,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:46:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:42,753 INFO L225 Difference]: With dead ends: 558 [2019-01-11 11:46:42,753 INFO L226 Difference]: Without dead ends: 557 [2019-01-11 11:46:42,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:46:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-11 11:46:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-11 11:46:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-11 11:46:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-11 11:46:42,877 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-11 11:46:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:42,877 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-11 11:46:42,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:46:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-11 11:46:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:42,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:42,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:42,879 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-11 11:46:42,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:42,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:42,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:42,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:42,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:42,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:42,960 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-11 11:46:42,961 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:42,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:43,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:43,239 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:43,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:43,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:43,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:43,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:43,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:43,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:43,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:46:43,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:46:43,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:46:43,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:46:43,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:43,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:43,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:43,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:43,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:43,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:46:43,510 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,536 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,556 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:43,629 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:46:43,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:46:43,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:43,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:46:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,718 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:43,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:46:43,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:43,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 11:46:43,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:43,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:46:43,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:43,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:43,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:46:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:43,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:43,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:46:43,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:43,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:46:43,877 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-11 11:46:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:44,592 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-11 11:46:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:46:44,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:46:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:44,597 INFO L225 Difference]: With dead ends: 795 [2019-01-11 11:46:44,598 INFO L226 Difference]: Without dead ends: 794 [2019-01-11 11:46:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:44,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-11 11:46:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-11 11:46:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-11 11:46:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-11 11:46:44,746 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-11 11:46:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:44,746 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-11 11:46:44,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:46:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-11 11:46:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:44,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:44,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:44,748 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-11 11:46:44,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:44,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:44,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:44,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:44,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:44,884 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-11 11:46:44,885 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:44,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:45,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:45,097 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:46:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:45,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:45,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:45,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:45,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:45,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:45,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:45,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:45,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:46:45,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:46:45,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:46:45,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:46:45,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:46:45,172 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:46:45,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:46:45,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:46:45,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:46:45,383 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,399 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,413 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:45,458 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:46:45,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 11:46:45,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:45,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:45,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:46:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:45,559 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:45,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:46:45,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:45,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:45,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-11 11:46:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:45,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:45,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:45,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:46:45,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:45,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:46:45,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:46:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:46:45,741 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-11 11:46:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:46,458 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-11 11:46:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:46:46,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:46:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:46,462 INFO L225 Difference]: With dead ends: 539 [2019-01-11 11:46:46,463 INFO L226 Difference]: Without dead ends: 538 [2019-01-11 11:46:46,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:46:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-11 11:46:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-11 11:46:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 11:46:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-11 11:46:46,665 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-11 11:46:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:46,665 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-11 11:46:46,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:46:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-11 11:46:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:46,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:46,666 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:46:46,667 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-11 11:46:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:46,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:46,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:46,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:46,866 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-11 11:46:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:46,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:46,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:46,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:46,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:46,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:46,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:46,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:46,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:46,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:46,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:46,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:46,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:46,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:46,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:46:46,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:46,985 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:46:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:46:47,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:46:47,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:46:47,245 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,262 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,294 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:47,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:47,328 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:46:47,570 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 11:46:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:46:47,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:47,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 11:46:47,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 11:46:47,947 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 11:46:47,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:47,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-11 11:46:47,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-11 11:46:48,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 11:46:48,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 11:46:48,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-11 11:46:48,425 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-11 11:46:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-11 11:46:48,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-01-11 11:46:48,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:48,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 11:46:48,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:48,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 11:46:48,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-11 11:46:48,998 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-11 11:46:49,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-11 11:46:49,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:46:49,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 11:46:49,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:49,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:49,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:49,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 11:46:49,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:49,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:46:49,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-11 11:46:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:49,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:49,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:49,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:46:49,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:49,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:46:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:46:49,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:49,905 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-11 11:46:50,143 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-11 11:46:50,763 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-11 11:46:51,247 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-11 11:46:51,839 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-11 11:46:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:52,667 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-11 11:46:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:46:52,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:46:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:52,672 INFO L225 Difference]: With dead ends: 678 [2019-01-11 11:46:52,673 INFO L226 Difference]: Without dead ends: 673 [2019-01-11 11:46:52,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:46:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-11 11:46:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-11 11:46:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-11 11:46:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-11 11:46:52,893 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-11 11:46:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:52,893 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-11 11:46:52,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:46:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-11 11:46:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:52,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:52,895 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:46:52,895 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-11 11:46:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:52,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:52,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:52,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:52,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:52,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:52,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:52,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:52,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:46:52,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:46:52,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:46:52,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:52,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:53,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:53,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:53,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:53,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:53,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:53,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:53,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:53,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:53,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:53,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:53,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:53,413 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,439 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,489 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:53,562 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:53,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:46:53,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:53,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:53,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,767 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-11 11:46:53,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:46:53,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:53,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:46:53,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:46:53,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:53,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:53,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-11 11:46:53,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:53,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-01-11 11:46:53,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:54,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:54,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-11 11:46:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:54,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:54,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:46:54,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:54,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:46:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:46:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:54,094 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-11 11:46:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:54,963 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-11 11:46:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:46:54,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:46:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:54,970 INFO L225 Difference]: With dead ends: 704 [2019-01-11 11:46:54,970 INFO L226 Difference]: Without dead ends: 703 [2019-01-11 11:46:54,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:46:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-11 11:46:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-11 11:46:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-11 11:46:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-11 11:46:55,242 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-11 11:46:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:55,242 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-11 11:46:55,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:46:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-11 11:46:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:55,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:55,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:55,244 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:55,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:55,244 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-11 11:46:55,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:55,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:55,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:55,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:55,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:55,465 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 13 [2019-01-11 11:46:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:55,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:55,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:55,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:46:55,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:46:55,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:55,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:55,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:46:55,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:46:55,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:46:55,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:46:55,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:55,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:55,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:55,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:55,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:55,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:55,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:55,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:55,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:55,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:55,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:55,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:56,000 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,025 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,050 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,076 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,102 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:56,147 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:56,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:46:56,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:56,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:56,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:46:56,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:56,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:46:56,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,351 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:46:56,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:56,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:46:56,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:56,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:46:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:56,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:56,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:46:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:56,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:56,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:56,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:46:56,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:56,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:46:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:46:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:46:56,608 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-11 11:46:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:46:58,171 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-11 11:46:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:46:58,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:46:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:46:58,179 INFO L225 Difference]: With dead ends: 1218 [2019-01-11 11:46:58,179 INFO L226 Difference]: Without dead ends: 1217 [2019-01-11 11:46:58,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:46:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-11 11:46:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-11 11:46:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-11 11:46:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-11 11:46:58,551 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-11 11:46:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:46:58,551 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-11 11:46:58,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:46:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-11 11:46:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:46:58,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:46:58,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:46:58,553 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:46:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-11 11:46:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:46:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:58,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:46:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:46:58,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:46:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:46:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:58,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:46:58,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:46:58,716 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-11 11:46:58,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:46:58,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:46:59,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:46:59,019 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:46:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:46:59,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:46:59,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:46:59,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:46:59,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:46:59,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:46:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:46:59,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:46:59,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:46:59,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:46:59,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:46:59,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:46:59,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:46:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:46:59,113 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,153 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:46:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:46:59,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:46:59,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:46:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:46:59,475 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,500 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,526 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,552 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,578 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:59,625 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:46:59,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:46:59,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:59,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:46:59,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,743 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:46:59,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:46:59,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:59,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-11 11:46:59,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:46:59,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:46:59,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:46:59,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:46:59,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-11 11:46:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:59,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:46:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:46:59,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:46:59,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:46:59,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:46:59,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:46:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:46:59,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:46:59,962 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-11 11:47:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:00,791 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-11 11:47:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:00,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:47:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:00,797 INFO L225 Difference]: With dead ends: 814 [2019-01-11 11:47:00,797 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 11:47:00,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 11:47:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-11 11:47:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-11 11:47:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-11 11:47:01,134 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-11 11:47:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:01,134 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-11 11:47:01,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:47:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-11 11:47:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:01,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:01,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:01,136 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-11 11:47:01,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:01,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:01,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:47:01,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:01,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:01,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:01,247 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-11 11:47:01,248 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:01,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:01,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:01,531 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:01,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:01,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:01,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:01,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:01,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:01,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:01,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:01,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:01,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:01,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:01,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:01,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:01,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:01,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:01,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:01,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:01,884 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,928 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,962 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:01,985 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:02,063 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:02,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:47:02,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:02,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:47:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,183 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:02,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:47:02,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:02,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:47:02,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:02,246 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:02,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:47:02,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:02,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:02,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:47:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:02,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:02,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:47:02,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:02,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:47:02,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:47:02,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:47:02,365 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-11 11:47:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:03,238 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-11 11:47:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:03,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:47:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:03,243 INFO L225 Difference]: With dead ends: 812 [2019-01-11 11:47:03,243 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 11:47:03,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 11:47:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-11 11:47:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-11 11:47:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-11 11:47:03,554 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-11 11:47:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:03,554 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-11 11:47:03,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:47:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-11 11:47:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:03,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:03,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:03,555 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-11 11:47:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:03,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:03,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:03,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:47:03,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:03,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:03,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:03,644 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-11 11:47:03,645 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:03,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:03,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:03,910 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:47:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:03,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:03,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:03,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:03,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:03,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:03,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:03,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:03,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:47:03,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:47:03,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:47:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:47:03,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:03,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:47:03,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:47:04,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:47:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:47:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:47:04,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:47:04,312 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,336 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,360 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,385 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,411 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:04,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:04,455 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:47:04,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:04,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:47:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:05,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:05,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:47:05,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:05,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:05,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:05,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:47:05,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:05,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:05,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-11 11:47:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:05,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:05,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:47:05,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:05,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:47:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:47:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:47:05,585 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-11 11:47:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:06,248 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-11 11:47:06,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:06,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:47:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:06,251 INFO L225 Difference]: With dead ends: 843 [2019-01-11 11:47:06,251 INFO L226 Difference]: Without dead ends: 842 [2019-01-11 11:47:06,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:47:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-11 11:47:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-11 11:47:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-11 11:47:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-11 11:47:06,573 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-11 11:47:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:06,573 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-11 11:47:06,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:47:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-11 11:47:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:06,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:06,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:06,574 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-11 11:47:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:06,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:47:06,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:06,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:06,637 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:06,637 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-11 11:47:06,638 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:06,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:06,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:06,978 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:06,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:06,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:06,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:06,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:07,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:07,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:07,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:07,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:07,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:07,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:07,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:07,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:07,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:07,313 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,338 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,358 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:07,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:07,429 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:47:07,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:07,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:07,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 11:47:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:07,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 11:47:07,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:47:08,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:08,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-11 11:47:08,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:08,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-11 11:47:08,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-11 11:47:08,683 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-11 11:47:08,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-11 11:47:08,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:08,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,825 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:08,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-11 11:47:08,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:08,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,961 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:08,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:08,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-11 11:47:08,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:09,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:09,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 11:47:09,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:09,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 11:47:09,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-11 11:47:09,327 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-11 11:47:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:09,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:09,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:09,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:47:09,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:09,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:47:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:47:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:09,409 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-11 11:47:09,596 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-11 11:47:09,836 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 11:47:10,864 WARN L181 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-11 11:47:11,498 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-11 11:47:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:11,798 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-11 11:47:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:47:11,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:47:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:11,803 INFO L225 Difference]: With dead ends: 896 [2019-01-11 11:47:11,803 INFO L226 Difference]: Without dead ends: 895 [2019-01-11 11:47:11,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:47:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-11 11:47:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-11 11:47:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-11 11:47:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-11 11:47:12,143 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-11 11:47:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:12,143 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-11 11:47:12,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:47:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-11 11:47:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:12,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:12,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:12,145 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-11 11:47:12,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:12,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:12,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:12,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:12,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:12,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:12,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:12,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:12,268 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-11 11:47:12,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:12,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:12,554 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:12,554 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:12,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:12,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:12,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:12,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:12,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:12,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:12,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:12,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:12,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:12,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:12,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:12,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:12,827 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,874 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,890 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,903 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,916 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:12,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:12,949 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:12,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:12,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:47:12,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:13,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:13,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:47:13,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:47:13,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:13,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:47:13,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:13,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:13,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:47:13,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:13,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:13,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:47:13,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-01-11 11:47:13,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:13,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:47:13,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:13,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:47:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:47:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:13,344 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-11 11:47:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:14,353 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-11 11:47:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:47:14,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:47:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:14,357 INFO L225 Difference]: With dead ends: 975 [2019-01-11 11:47:14,357 INFO L226 Difference]: Without dead ends: 973 [2019-01-11 11:47:14,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-11 11:47:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-11 11:47:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-11 11:47:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-11 11:47:14,710 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-11 11:47:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-11 11:47:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:47:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-11 11:47:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:14,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:14,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:14,713 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-11 11:47:14,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:14,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:14,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:14,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:14,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:47:14,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:14,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:14,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:14,846 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-11 11:47:14,847 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:14,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:15,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:15,121 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:47:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:15,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:15,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:15,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:15,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:15,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:15,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:15,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:15,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:47:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:47:15,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:47:15,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:47:15,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:47:15,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:47:15,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:47:15,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:47:15,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:47:15,419 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,432 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,447 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,463 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:15,494 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:47:15,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:47:15,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:15,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:15,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:47:15,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-11 11:47:15,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:15,744 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:15,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-11 11:47:15,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:15,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:15,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-11 11:47:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:15,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:15,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:15,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:47:15,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:15,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:47:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:47:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:47:15,874 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-11 11:47:16,241 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-11 11:47:16,450 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-11 11:47:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:17,233 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-11 11:47:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:17,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:47:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:17,236 INFO L225 Difference]: With dead ends: 985 [2019-01-11 11:47:17,236 INFO L226 Difference]: Without dead ends: 984 [2019-01-11 11:47:17,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-11 11:47:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-11 11:47:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-11 11:47:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-11 11:47:17,626 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-11 11:47:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:17,626 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-11 11:47:17,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:47:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-11 11:47:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:17,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:17,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:17,628 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-11 11:47:17,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:17,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:17,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:17,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:17,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:17,731 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-11 11:47:17,732 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:17,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:18,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:18,129 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:47:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:18,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:18,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:18,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:18,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:18,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:18,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:47:18,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:47:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:47:18,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:47:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:47:18,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:18,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:18,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:18,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:18,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:18,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:47:18,553 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,588 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,624 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:18,694 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:47:18,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:47:18,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:18,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:47:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:47:18,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:18,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:47:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:18,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:18,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:47:18,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:18,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:18,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:47:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:19,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:47:19,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:19,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:19,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:47:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:19,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:19,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:19,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:47:19,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:19,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:19,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:19,859 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-11 11:47:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:24,367 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-11 11:47:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:47:24,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:24,372 INFO L225 Difference]: With dead ends: 1024 [2019-01-11 11:47:24,372 INFO L226 Difference]: Without dead ends: 1023 [2019-01-11 11:47:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:47:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-11 11:47:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-11 11:47:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-11 11:47:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-11 11:47:24,770 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-11 11:47:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:24,770 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-11 11:47:24,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-11 11:47:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:24,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:24,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:24,772 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-11 11:47:24,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:24,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:24,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:24,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:24,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:24,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:24,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:24,948 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-11 11:47:24,949 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:24,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:25,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:25,344 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:47:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:25,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:25,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:25,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:25,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:25,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:25,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:25,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:25,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:25,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:25,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:47:25,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:47:25,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:47:25,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:47:25,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:47:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:47:25,797 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,849 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,901 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:25,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:25,948 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:47:25,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:25,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:47:25,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:26,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:26,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:47:26,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:47:26,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:26,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:26,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:47:26,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:26,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:47:26,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:26,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:26,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:47:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:26,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:26,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-11 11:47:26,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:26,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:26,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 11:47:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:26,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:26,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:26,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:47:26,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:26,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:26,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:26,430 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-11 11:47:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:29,574 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-11 11:47:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:47:29,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:29,579 INFO L225 Difference]: With dead ends: 1059 [2019-01-11 11:47:29,579 INFO L226 Difference]: Without dead ends: 1057 [2019-01-11 11:47:29,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:47:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-11 11:47:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-11 11:47:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-11 11:47:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-11 11:47:30,012 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-11 11:47:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:30,012 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-11 11:47:30,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-11 11:47:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:30,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:30,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:30,014 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-11 11:47:30,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:30,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:30,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:30,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:30,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:30,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:30,089 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-11 11:47:30,090 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:30,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:30,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:30,440 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:47:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:30,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:30,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:30,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:30,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:30,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:30,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:30,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:30,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:30,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:30,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:30,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:30,527 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,557 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:30,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:30,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:30,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:30,773 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,805 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:30,854 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:47:30,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:30,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:30,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:47:30,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:30,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:47:30,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:31,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:31,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 11:47:31,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:31,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:47:31,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:31,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:31,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:47:31,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:31,126 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:31,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 11:47:31,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:31,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:31,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:47:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:31,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:31,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:47:31,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:31,259 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-11 11:47:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:33,420 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-11 11:47:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:47:33,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:33,426 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 11:47:33,426 INFO L226 Difference]: Without dead ends: 1042 [2019-01-11 11:47:33,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:47:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-11 11:47:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-11 11:47:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-11 11:47:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-11 11:47:33,870 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-11 11:47:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:33,871 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-11 11:47:33,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-11 11:47:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:33,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:33,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:33,873 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-11 11:47:33,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:33,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:34,066 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-11 11:47:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:34,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:34,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:34,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:47:34,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:47:34,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:34,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:34,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:47:34,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:47:34,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:47:34,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:47:34,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:34,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:47:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:47:34,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:47:34,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:47:34,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:47:34,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:34,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:34,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:34,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:34,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:34,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:47:34,529 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,564 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,583 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:34,670 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:47:34,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:47:34,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:34,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:47:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:47:34,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:34,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:47:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,896 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:34,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:47:34,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:34,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:34,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:47:34,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,993 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:34,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:34,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:47:34,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:35,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:35,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:47:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:35,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:47:35,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:35,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:35,351 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-11 11:47:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:36,653 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-11 11:47:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:47:36,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:36,659 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 11:47:36,659 INFO L226 Difference]: Without dead ends: 1041 [2019-01-11 11:47:36,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:47:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-11 11:47:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-11 11:47:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-11 11:47:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-11 11:47:37,053 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-11 11:47:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:37,053 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-11 11:47:37,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-11 11:47:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:37,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:37,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:37,056 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:37,056 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-11 11:47:37,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:37,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:47:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:37,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:37,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:37,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:37,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:37,142 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-11 11:47:37,143 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:37,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:37,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:37,548 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:47:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:37,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:37,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:37,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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:37,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:37,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:37,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:37,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:37,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:37,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:37,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:37,648 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,695 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:37,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:37,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:37,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:37,935 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,970 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:37,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:38,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:38,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:38,037 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:47:38,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:38,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:38,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 11:47:38,367 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-11 11:47:38,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:38,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-11 11:47:38,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:38,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:38,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-11 11:47:38,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:38,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 11:47:38,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-11 11:47:38,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-11 11:47:38,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:38,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:38,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-11 11:47:38,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:39,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-11 11:47:39,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:39,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-11 11:47:39,193 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-11 11:47:39,324 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-11 11:47:39,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-11 11:47:39,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:39,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,489 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:39,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-11 11:47:39,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-11 11:47:39,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,791 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:39,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-11 11:47:39,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:39,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:39,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-11 11:47:39,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:40,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 11:47:40,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-11 11:47:41,374 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-11 11:47:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:41,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:41,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:41,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:47:41,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:41,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:41,489 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-11 11:47:41,689 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 11:47:41,954 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 11:47:42,376 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-11 11:47:42,856 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-11 11:47:43,529 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-11 11:47:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:44,417 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-11 11:47:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:47:44,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:44,423 INFO L225 Difference]: With dead ends: 1104 [2019-01-11 11:47:44,423 INFO L226 Difference]: Without dead ends: 1102 [2019-01-11 11:47:44,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:47:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-11 11:47:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-11 11:47:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-11 11:47:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-11 11:47:44,857 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-11 11:47:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:44,857 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-11 11:47:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-11 11:47:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:44,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:44,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:44,860 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-11 11:47:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:44,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:44,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:44,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:44,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:44,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:44,967 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-11 11:47:44,970 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:44,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:45,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:45,329 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:47:45,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:45,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:45,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:45,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:45,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:45,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:45,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:45,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:47:45,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:47:45,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:47:45,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:47:45,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:45,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:47:45,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:47:45,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:47:45,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:47:45,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:47:45,632 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,659 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,696 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:45,755 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:47:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:47:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:45,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:47:45,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:45,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:47:45,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:45,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-11 11:47:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:47:45,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:45,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:45,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:47:45,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:45,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:46,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:46,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:47:46,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:46,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:46,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-11 11:47:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:46,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:46,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:46,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:47:46,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:46,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:47:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:47:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:47:46,127 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-11 11:47:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:48,596 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-11 11:47:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:47:48,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:47:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:48,602 INFO L225 Difference]: With dead ends: 1313 [2019-01-11 11:47:48,603 INFO L226 Difference]: Without dead ends: 1312 [2019-01-11 11:47:48,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:47:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-11 11:47:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-11 11:47:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-11 11:47:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-11 11:47:49,057 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-11 11:47:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:49,057 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-11 11:47:49,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:47:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-11 11:47:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:49,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:49,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:49,059 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-11 11:47:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:49,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:49,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:49,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:49,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:49,130 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-11 11:47:49,131 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:49,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:49,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:49,426 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:49,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:49,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:49,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:49,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:49,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:49,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:49,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:49,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:47:49,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:47:49,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:47:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:47:49,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:49,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:47:49,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:47:50,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:47:50,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:47:50,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:47:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:50,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:47:50,917 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,942 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,966 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:50,990 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,017 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:51,061 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:47:51,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:47:51,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:51,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:47:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 11:47:51,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:51,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 11:47:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:51,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:51,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:47:51,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:51,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:51,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 11:47:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:51,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:47:51,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:51,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:47:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:47:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:51,454 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-11 11:47:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:52,407 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-11 11:47:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:47:52,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:47:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:52,410 INFO L225 Difference]: With dead ends: 881 [2019-01-11 11:47:52,410 INFO L226 Difference]: Without dead ends: 880 [2019-01-11 11:47:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:47:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-11 11:47:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-11 11:47:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-11 11:47:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-11 11:47:52,864 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-11 11:47:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:52,864 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-11 11:47:52,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:47:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-11 11:47:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:52,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:52,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:52,866 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-11 11:47:52,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:52,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:52,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:52,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:52,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:52,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:52,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:52,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:52,990 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-11 11:47:52,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:52,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:53,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:53,266 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:53,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:53,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:53,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:53,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:53,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:53,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:53,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:47:53,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:47:53,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:47:53,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:47:53,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:47:53,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:47:53,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:47:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:47:53,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:47:53,557 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,572 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,586 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,602 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:53,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:47:53,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 11:47:53,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:53,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:47:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:47:53,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:53,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:47:53,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:47:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:53,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:53,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:47:53,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:53,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:53,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 11:47:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:53,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:54,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:54,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:47:54,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:54,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:47:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:47:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:47:54,013 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-11 11:47:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:47:55,250 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-11 11:47:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:47:55,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:47:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:47:55,255 INFO L225 Difference]: With dead ends: 1415 [2019-01-11 11:47:55,255 INFO L226 Difference]: Without dead ends: 1413 [2019-01-11 11:47:55,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-11 11:47:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-11 11:47:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-11 11:47:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-11 11:47:56,007 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-11 11:47:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:47:56,007 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-11 11:47:56,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:47:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-11 11:47:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:47:56,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:47:56,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:47:56,010 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:47:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-11 11:47:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:47:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:47:56,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:47:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:56,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:56,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:47:56,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:47:56,083 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-11 11:47:56,084 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:47:56,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:47:56,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:47:56,375 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:47:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:47:56,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:47:56,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:47:56,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:47:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:47:56,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:47:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:47:56,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:47:56,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:47:56,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:47:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:47:56,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:56,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:47:56,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:47:56,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:47:56,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:47:56,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:47:56,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:47:56,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:47:56,618 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,642 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,661 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,686 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:47:56,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:47:56,728 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:47:56,934 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 11:47:56,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:47:57,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 11:47:57,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 11:47:57,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-11 11:47:57,745 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 86 [2019-01-11 11:47:57,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2019-01-11 11:47:57,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:57,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:57,855 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:57,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2019-01-11 11:47:57,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:58,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-11 11:47:58,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-11 11:47:58,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-11 11:47:58,268 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:186, output treesize:180 [2019-01-11 11:47:58,390 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-01-11 11:47:58,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 77 [2019-01-11 11:47:58,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:58,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:47:58,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-01-11 11:47:58,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:47:58,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-11 11:47:58,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:47:58,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 11:47:58,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-11 11:47:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:58,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:47:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:47:58,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:47:58,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:47:58,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:47:58,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:47:58,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:47:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:47:58,709 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-11 11:47:59,092 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 11:48:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:02,566 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-11 11:48:02,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:48:02,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:48:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:02,571 INFO L225 Difference]: With dead ends: 1381 [2019-01-11 11:48:02,571 INFO L226 Difference]: Without dead ends: 1379 [2019-01-11 11:48:02,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:48:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-11 11:48:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-11 11:48:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 11:48:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 11:48:03,290 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 11:48:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:03,291 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 11:48:03,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:48:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 11:48:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:03,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:03,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:03,293 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-11 11:48:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:03,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:03,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:03,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:03,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:03,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:48:03,374 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-11 11:48:03,374 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:03,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:03,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:03,875 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:48:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:03,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:03,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:03,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:03,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:03,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:03,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:48:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:48:03,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:03,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:48:04,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:48:04,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:48:04,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:04,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:48:04,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:48:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:48:04,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:48:04,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:48:04,278 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,312 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,331 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,344 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,356 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,368 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:04,411 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:48:04,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:48:04,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:04,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:04,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:48:04,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:04,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:04,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:48:04,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:04,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:48:04,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-11 11:48:04,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-01-11 11:48:04,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:04,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:04,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:48:04,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:04,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:48:04,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:48:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:48:04,759 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-11 11:48:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:05,881 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-11 11:48:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:48:05,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:48:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:05,887 INFO L225 Difference]: With dead ends: 1306 [2019-01-11 11:48:05,887 INFO L226 Difference]: Without dead ends: 1305 [2019-01-11 11:48:05,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:48:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-11 11:48:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-11 11:48:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 11:48:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 11:48:06,575 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 11:48:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:06,575 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 11:48:06,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:48:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 11:48:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:06,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:06,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:06,578 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:06,578 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-11 11:48:06,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:06,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:06,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:06,735 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-11 11:48:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:06,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:06,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:06,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:48:06,786 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-11 11:48:06,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:06,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:07,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:07,148 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:48:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:07,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:07,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:07,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:07,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:07,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:07,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:07,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:48:07,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:48:07,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:48:07,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:48:07,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:48:07,422 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:07,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:48:07,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:48:07,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:48:07,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:48:07,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:48:07,575 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,608 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,627 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:07,713 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:48:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:48:07,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:07,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:48:07,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,844 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:07,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:48:07,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:07,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-11 11:48:07,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:07,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:48:07,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:07,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:07,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-11 11:48:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:08,029 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:08,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-11 11:48:08,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:08,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:08,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 11:48:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:08,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:08,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:08,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:48:08,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:08,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:48:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:48:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:48:08,192 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-11 11:48:08,379 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-01-11 11:48:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:09,881 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-11 11:48:09,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:48:09,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:48:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:09,887 INFO L225 Difference]: With dead ends: 1360 [2019-01-11 11:48:09,888 INFO L226 Difference]: Without dead ends: 1358 [2019-01-11 11:48:09,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:48:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-11 11:48:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-11 11:48:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-11 11:48:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-11 11:48:10,576 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-11 11:48:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:10,576 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-11 11:48:10,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:48:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-11 11:48:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:10,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:10,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:10,579 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-11 11:48:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:10,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:10,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:10,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:10,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:10,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:10,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:10,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:10,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:10,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:48:10,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:48:10,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:48:10,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:10,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:48:10,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:48:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:48:10,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:48:10,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:10,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:48:10,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:10,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:11,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:48:11,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:48:11,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:48:11,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:48:11,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:48:11,109 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,146 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,167 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,184 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,196 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,208 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:11,256 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 11:48:11,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:48:11,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:11,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:48:11,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:48:11,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:11,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 11:48:11,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:11,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:11,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:48:11,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:11,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:11,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 11:48:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:11,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:11,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:11,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:48:11,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:11,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:48:11,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:48:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:48:11,588 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-11 11:48:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:13,354 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-11 11:48:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:48:13,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:48:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:13,362 INFO L225 Difference]: With dead ends: 1898 [2019-01-11 11:48:13,362 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 11:48:13,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:48:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 11:48:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-11 11:48:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-11 11:48:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-11 11:48:14,392 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-11 11:48:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:14,393 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-11 11:48:14,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:48:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-11 11:48:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:14,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:14,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:14,398 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-11 11:48:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:14,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:14,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:48:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:48:14,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:48:14,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:48:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:48:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:48:14,500 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-11 11:48:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:15,607 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-11 11:48:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:48:15,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 11:48:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:15,612 INFO L225 Difference]: With dead ends: 1693 [2019-01-11 11:48:15,613 INFO L226 Difference]: Without dead ends: 1692 [2019-01-11 11:48:15,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:48:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-11 11:48:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-11 11:48:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-11 11:48:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-11 11:48:16,647 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-11 11:48:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:16,648 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-11 11:48:16,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:48:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-11 11:48:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:16,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:16,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:16,651 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-11 11:48:16,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:16,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:16,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:16,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:16,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:16,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:48:16,700 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-11 11:48:16,701 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:16,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:16,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:16,914 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:48:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:16,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:16,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:16,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:16,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:16,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:16,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:16,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:16,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:48:16,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:48:16,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:48:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:48:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:16,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:48:16,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:48:17,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:48:17,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:48:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:48:17,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:48:17,318 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,342 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,366 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,417 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:17,461 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 11:48:17,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:48:17,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:17,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:48:17,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:17,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-11 11:48:17,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:17,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:17,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-11 11:48:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:17,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:17,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:17,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:48:17,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:17,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:48:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:48:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:48:17,648 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-11 11:48:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:19,775 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-11 11:48:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:48:19,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:48:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:19,784 INFO L225 Difference]: With dead ends: 2759 [2019-01-11 11:48:19,785 INFO L226 Difference]: Without dead ends: 2757 [2019-01-11 11:48:19,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:48:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-11 11:48:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-11 11:48:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-11 11:48:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-11 11:48:21,566 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-11 11:48:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-11 11:48:21,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:48:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-11 11:48:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:21,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:21,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:21,571 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-11 11:48:21,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:21,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:21,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:21,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:21,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:48:21,692 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-11 11:48:21,693 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:21,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:22,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:22,051 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:48:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:22,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:22,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:22,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:22,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:22,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:22,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:22,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:48:22,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:48:22,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:48:22,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:48:22,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:48:22,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:48:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:48:22,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:48:22,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:48:22,892 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-11 11:48:22,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:22,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:48:22,904 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,930 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,957 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:22,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,010 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:23,057 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:48:23,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:48:23,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:23,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:48:23,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,181 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:23,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:48:23,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:23,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 11:48:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:48:23,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:23,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 11:48:23,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,355 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:23,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:48:23,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:23,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:23,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:48:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:23,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:23,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:23,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:48:23,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:23,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:48:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:48:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:48:23,501 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-11 11:48:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:27,101 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-11 11:48:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:48:27,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:48:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:27,113 INFO L225 Difference]: With dead ends: 3636 [2019-01-11 11:48:27,113 INFO L226 Difference]: Without dead ends: 3626 [2019-01-11 11:48:27,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:48:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-11 11:48:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-11 11:48:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-11 11:48:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-11 11:48:29,717 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-11 11:48:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:29,717 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-11 11:48:29,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:48:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-11 11:48:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:48:29,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:29,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:48:29,722 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:29,722 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-11 11:48:29,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:29,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:29,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:29,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:29,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:48:29,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:48:29,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:29,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:29,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:48:29,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:48:29,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:48:29,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:48:29,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:29,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:29,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:48:29,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:48:29,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:48:29,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:48:29,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:29,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:48:29,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:29,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:48:30,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:48:30,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:48:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:48:30,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:48:30,182 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,205 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,228 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,279 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:30,323 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:48:30,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:48:30,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:30,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:48:30,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:48:30,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:30,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:48:30,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-11 11:48:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:30,656 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:30,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:48:30,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:30,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:30,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-11 11:48:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:30,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:48:30,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:30,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:48:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:48:30,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:48:30,754 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-11 11:48:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:34,828 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-11 11:48:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:48:34,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:48:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:34,844 INFO L225 Difference]: With dead ends: 4300 [2019-01-11 11:48:34,844 INFO L226 Difference]: Without dead ends: 4298 [2019-01-11 11:48:34,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:48:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-11 11:48:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-11 11:48:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-11 11:48:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-11 11:48:38,620 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-11 11:48:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:38,620 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-11 11:48:38,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:48:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-11 11:48:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:48:38,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:38,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:38,627 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-11 11:48:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:38,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:48:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:38,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:38,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:38,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:48:38,707 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-11 11:48:38,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:38,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:39,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:39,170 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:48:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:39,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:39,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:39,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:39,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:39,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:39,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:39,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:48:39,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:48:39,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:48:39,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:48:39,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:48:39,266 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:48:39,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:48:39,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:48:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:48:39,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:48:39,652 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,679 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,718 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,772 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:39,819 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:48:39,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:48:39,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:39,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:48:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:39,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:48:39,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:39,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:39,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:48:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:40,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 11:48:40,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:40,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:48:40,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:40,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:40,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:48:40,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:40,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:40,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 11:48:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:40,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:40,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:40,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:48:40,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:40,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:48:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:48:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:48:40,298 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-11 11:48:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:44,654 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-11 11:48:44,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:48:44,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:48:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:44,669 INFO L225 Difference]: With dead ends: 4236 [2019-01-11 11:48:44,669 INFO L226 Difference]: Without dead ends: 4233 [2019-01-11 11:48:44,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:48:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-11 11:48:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-11 11:48:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-11 11:48:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-11 11:48:48,481 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-11 11:48:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:48,481 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-11 11:48:48,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:48:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-11 11:48:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:48:48,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:48,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:48,488 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-11 11:48:48,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:48,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:48,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:48,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:48,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:48,604 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:48:48,604 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-11 11:48:48,605 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:48,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:48,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:48,954 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:48:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:48,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:48,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:48,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:48,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:48,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:48,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:49,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:48:49,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:48:49,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:48:49,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:48:49,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:48:49,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:48:49,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:48:49,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:48:49,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:48:49,272 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,307 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,360 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:49,405 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 11:48:49,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:48:49,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:49,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:48:49,638 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 11:48:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:48:49,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:49,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:48:49,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:49,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:48:49,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:49,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:48:49,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:49,797 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:49,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:48:49,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:49,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:49,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:48:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:49,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:48:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:48:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:48:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:48:49,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:48:49,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:48:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:48:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:48:49,965 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-11 11:48:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:48:54,460 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-11 11:48:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:48:54,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:48:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:48:54,475 INFO L225 Difference]: With dead ends: 4232 [2019-01-11 11:48:54,475 INFO L226 Difference]: Without dead ends: 4231 [2019-01-11 11:48:54,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:48:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-11 11:48:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-11 11:48:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-11 11:48:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-11 11:48:58,276 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-11 11:48:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:48:58,276 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-11 11:48:58,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:48:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-11 11:48:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:48:58,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:48:58,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:48:58,282 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:48:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-11 11:48:58,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:48:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:48:58,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:48:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:58,437 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:48:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:48:58,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:58,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:48:58,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:48:58,499 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-11 11:48:58,500 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:48:58,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:48:58,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:48:58,893 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:48:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:48:58,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:48:58,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:48:58,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:48:58,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:48:58,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:48:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:48:58,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:48:58,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:48:58,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:48:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:58,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:48:59,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:48:59,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:48:59,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:48:59,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:48:59,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:48:59,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:48:59,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:48:59,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:48:59,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,403 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,422 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,444 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,460 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,478 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:59,533 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:48:59,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:48:59,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:59,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:48:59,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:48:59,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:48:59,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:48:59,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-11 11:48:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:48:59,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:48:59,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:48:59,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:48:59,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:48:59,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:49:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:00,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:00,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:00,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:49:00,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:00,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:49:00,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:49:00,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:49:00,057 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-11 11:49:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:04,348 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-11 11:49:04,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:49:04,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:49:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:04,366 INFO L225 Difference]: With dead ends: 4570 [2019-01-11 11:49:04,366 INFO L226 Difference]: Without dead ends: 4569 [2019-01-11 11:49:04,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:49:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-11 11:49:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-11 11:49:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-11 11:49:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-11 11:49:08,422 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-11 11:49:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:08,423 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-11 11:49:08,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:49:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-11 11:49:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:49:08,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:08,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:08,430 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-11 11:49:08,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:08,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:08,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:49:08,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:08,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:08,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:49:08,655 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-11 11:49:08,656 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:08,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:09,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:09,428 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:49:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:09,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:09,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:09,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:09,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:09,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:09,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:09,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:49:09,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:49:09,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:49:09,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:49:09,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:49:09,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:49:09,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,560 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:49:09,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:49:09,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:49:09,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:49:09,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:09,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:49:09,924 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,949 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:09,975 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,003 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,029 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:10,075 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:49:10,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:49:10,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:10,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:49:10,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:49:10,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:10,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:49:10,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,623 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:10,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:49:10,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:10,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 11:49:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:10,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:10,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 131 [2019-01-11 11:49:10,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:10,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:10,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 11:49:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:10,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:10,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:10,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:49:10,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:10,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:49:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:49:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:49:10,911 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-11 11:49:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:17,010 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-11 11:49:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:49:17,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:49:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:17,033 INFO L225 Difference]: With dead ends: 5928 [2019-01-11 11:49:17,033 INFO L226 Difference]: Without dead ends: 5927 [2019-01-11 11:49:17,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:49:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-11 11:49:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-11 11:49:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-11 11:49:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-11 11:49:22,357 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-11 11:49:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:22,357 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-11 11:49:22,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:49:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-11 11:49:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:49:22,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:22,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:22,365 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-11 11:49:22,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:22,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:22,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:49:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:22,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:22,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:49:22,505 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-11 11:49:22,506 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:22,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:22,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:22,805 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:49:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:22,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:22,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:22,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:22,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:22,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:22,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:49:22,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:49:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:49:22,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:49:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:22,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:49:22,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:49:22,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:49:23,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:49:23,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:49:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:49:23,201 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,216 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:23,276 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:49:23,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 11:49:23,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:23,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:49:23,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:49:23,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:49:23,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:49:23,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 11:49:23,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:23,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-11 11:49:23,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:23,606 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:23,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-11 11:49:23,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:23,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:49:23,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:49:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:23,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:49:23,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:23,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:49:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:49:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:49:23,748 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-11 11:49:23,993 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-11 11:49:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:30,805 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-11 11:49:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:49:30,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:49:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:30,831 INFO L225 Difference]: With dead ends: 6511 [2019-01-11 11:49:30,831 INFO L226 Difference]: Without dead ends: 6510 [2019-01-11 11:49:30,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:49:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-11 11:49:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-11 11:49:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-11 11:49:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-11 11:49:37,895 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-11 11:49:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:37,895 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-11 11:49:37,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:49:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-11 11:49:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:49:37,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:37,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:37,904 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:37,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-11 11:49:37,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:37,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:38,402 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-11 11:49:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:38,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:38,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:38,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:49:38,589 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-11 11:49:38,590 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:38,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:39,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:39,095 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:49:39,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:39,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:39,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:39,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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:39,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:39,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:39,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:39,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:49:39,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:49:39,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:49:39,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:49:39,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:49:39,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:49:39,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:49:39,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:49:39,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:49:39,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:49:39,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:49:39,477 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,512 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,528 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,543 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,555 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,567 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:39,611 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-11 11:49:39,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:49:39,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:39,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:49:39,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:49:39,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:39,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:49:39,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,830 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:39,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:49:39,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:39,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:49:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:39,912 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:49:39,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 11:49:39,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:39,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:39,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:49:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:39,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:40,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:40,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:49:40,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:40,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:49:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:49:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:49:40,065 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-11 11:49:40,574 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-01-11 11:49:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:49:49,080 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-11 11:49:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:49:49,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:49:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:49:49,107 INFO L225 Difference]: With dead ends: 7179 [2019-01-11 11:49:49,107 INFO L226 Difference]: Without dead ends: 7170 [2019-01-11 11:49:49,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:49:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-11 11:49:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-11 11:49:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-11 11:49:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-11 11:49:56,066 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-11 11:49:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:49:56,067 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-11 11:49:56,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:49:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-11 11:49:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:49:56,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:49:56,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:49:56,075 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:49:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-11 11:49:56,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:49:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:56,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:49:56,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:49:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:56,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:56,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:49:56,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:49:56,119 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-11 11:49:56,120 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:49:56,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:49:56,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:49:56,334 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:49:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:49:56,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:49:56,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:49:56,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:49:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:49:56,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:49:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:49:56,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:49:56,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-11 11:49:56,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-11 11:49:56,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-11 11:49:56,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-11 11:49:56,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-11 11:49:56,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:49:56,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:49:56,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:49:56,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-11 11:49:56,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-11 11:49:56,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:49:56,595 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,743 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,757 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:49:56,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:56,825 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-11 11:49:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:56,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-11 11:49:56,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:49:57,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-11 11:49:57,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:369 [2019-01-11 11:49:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:49:57,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:49:57,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:49:57,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:49:57,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 11:49:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:57,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:49:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:49:57,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:49:57,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:49:57,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:49:57,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:49:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:49:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:49:57,336 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-11 11:50:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:07,283 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-11 11:50:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:50:07,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:50:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:07,327 INFO L225 Difference]: With dead ends: 10441 [2019-01-11 11:50:07,327 INFO L226 Difference]: Without dead ends: 10440 [2019-01-11 11:50:07,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:50:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-11 11:50:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-11 11:50:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-11 11:50:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-11 11:50:18,161 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-11 11:50:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:18,162 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-11 11:50:18,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:50:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-11 11:50:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:50:18,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:18,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:18,173 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-11 11:50:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:18,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:18,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:18,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:50:18,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:18,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:18,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:50:18,281 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-11 11:50:18,282 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:18,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:18,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:18,722 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:50:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:18,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:18,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:18,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:50:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:18,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:18,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:18,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:50:18,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:50:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:50:18,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:50:18,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:50:18,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:50:18,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:18,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:50:18,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:50:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:18,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:50:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:50:19,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:50:19,120 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,144 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,192 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:19,261 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:50:19,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:50:19,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:19,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:50:19,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,370 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:19,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-11 11:50:19,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:19,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:19,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-11 11:50:19,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:19,450 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:19,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 11:50:19,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:50:19,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:50:19,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-11 11:50:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:19,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:19,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:19,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:50:19,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:50:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:50:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:50:19,700 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-11 11:50:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:30,022 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-11 11:50:30,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:50:30,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:50:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:30,063 INFO L225 Difference]: With dead ends: 10427 [2019-01-11 11:50:30,063 INFO L226 Difference]: Without dead ends: 10426 [2019-01-11 11:50:30,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:50:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-11 11:50:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-11 11:50:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-11 11:50:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-11 11:50:40,887 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-11 11:50:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:50:40,887 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-11 11:50:40,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:50:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-11 11:50:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:50:40,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:50:40,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:50:40,899 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:50:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-11 11:50:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:50:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:40,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:50:40,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:50:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:40,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:40,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:50:40,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:50:40,970 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-11 11:50:40,970 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:50:40,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:50:41,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:50:41,320 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:50:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:50:41,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:50:41,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:50:41,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:50:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:50:41,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:50:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:50:41,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:50:41,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:50:41,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:50:41,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:50:41,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:50:41,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:50:41,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:50:41,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,432 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:50:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:50:41,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:50:41,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:50:41,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,634 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,648 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,664 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:41,694 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:50:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:50:41,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:41,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:50:41,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,790 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:41,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:50:41,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:41,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 11:50:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:50:41,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:41,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:50:41,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:50:41,915 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:50:41,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:50:41,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:50:41,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:50:41,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:50:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:41,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:50:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:50:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:50:42,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:50:42,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:50:42,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:50:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:50:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:50:42,072 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-11 11:50:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:50:53,250 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-11 11:50:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:50:53,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:50:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:50:53,299 INFO L225 Difference]: With dead ends: 11408 [2019-01-11 11:50:53,299 INFO L226 Difference]: Without dead ends: 11406 [2019-01-11 11:50:53,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:50:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-11 11:51:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-11 11:51:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-11 11:51:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-11 11:51:04,623 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-11 11:51:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:04,623 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-11 11:51:04,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:51:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-11 11:51:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:51:04,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:04,635 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:51:04,635 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-11 11:51:04,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:04,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:04,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:04,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:04,783 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-01-11 11:51:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:51:04,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:04,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:04,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:51:04,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:51:04,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:04,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:51:04,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:51:04,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:51:04,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:51:04,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:51:04,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:04,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:51:04,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:51:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:04,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:51:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:51:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:51:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:51:05,092 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:51:05,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:51:05,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:51:05,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:51:05,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:51:05,455 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,481 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,561 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:05,606 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:51:05,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:51:05,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:05,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:51:05,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:51:05,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:05,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 11:51:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:05,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-11 11:51:05,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:05,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:05,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-11 11:51:05,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,979 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:05,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:05,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:51:05,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:06,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:06,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-11 11:51:06,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:06,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-11 11:51:06,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:06,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:06,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-11 11:51:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:06,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:06,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:06,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:51:06,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:06,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:51:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:51:06,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:51:06,261 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-11 11:51:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:21,233 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-11 11:51:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:51:21,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:51:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:21,296 INFO L225 Difference]: With dead ends: 14692 [2019-01-11 11:51:21,297 INFO L226 Difference]: Without dead ends: 14688 [2019-01-11 11:51:21,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:51:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-11 11:51:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-11 11:51:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-11 11:51:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-11 11:51:35,128 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-11 11:51:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:51:35,128 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-11 11:51:35,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:51:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-11 11:51:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:51:35,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:51:35,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:51:35,141 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:51:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-11 11:51:35,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:51:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:35,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:51:35,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:51:35,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:51:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:35,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:35,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:51:35,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:51:35,206 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-11 11:51:35,206 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:51:35,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:51:35,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:51:35,506 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:51:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:51:35,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:51:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:51:35,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:51:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:51:35,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:51:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:51:35,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:51:35,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:51:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:51:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:51:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:51:35,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:51:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:51:35,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:51:35,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:51:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:51:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:51:35,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:35,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:51:35,922 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,947 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,971 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:35,996 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:36,022 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:51:36,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:36,067 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:51:36,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 11:51:36,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:36,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:36,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 11:51:36,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-11 11:51:36,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:36,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:36,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 11:51:36,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,278 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:51:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:51:36,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:51:36,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:51:36,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:51:36,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 11:51:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:36,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:51:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:51:36,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:51:36,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:51:36,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:51:36,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:51:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:51:36,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:51:36,403 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-11 11:51:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:51:49,381 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-11 11:51:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:51:49,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:51:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:51:49,433 INFO L225 Difference]: With dead ends: 13016 [2019-01-11 11:51:49,433 INFO L226 Difference]: Without dead ends: 13015 [2019-01-11 11:51:49,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:51:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-11 11:52:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-11 11:52:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 11:52:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 11:52:03,312 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 11:52:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:03,312 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 11:52:03,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:52:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 11:52:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:52:03,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:03,327 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:52:03,327 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-11 11:52:03,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:03,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:03,609 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-11 11:52:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:52:03,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:03,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:03,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:52:03,620 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-11 11:52:03,621 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:03,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:52:03,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:52:03,778 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:52:03,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:03,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:52:03,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:03,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:52:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:03,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:03,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:03,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:52:03,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:52:03,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:52:03,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:52:03,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:52:03,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:52:03,833 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:03,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:52:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:03,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:52:04,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:52:04,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:52:04,055 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:04,069 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:04,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:04,099 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:04,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:52:04,130 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 11:52:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:52:04,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:52:04,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:52:04,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:52:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:04,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:52:04,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:04,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:52:04,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-11 11:52:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:04,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:04,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:04,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:52:04,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:04,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:52:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:52:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:52:04,384 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-11 11:52:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:17,136 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-11 11:52:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:52:17,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:52:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:17,190 INFO L225 Difference]: With dead ends: 12974 [2019-01-11 11:52:17,190 INFO L226 Difference]: Without dead ends: 12973 [2019-01-11 11:52:17,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:52:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-11 11:52:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-11 11:52:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 11:52:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 11:52:31,159 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 11:52:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:31,160 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 11:52:31,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:52:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 11:52:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:52:31,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:31,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:52:31,171 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-11 11:52:31,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:31,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:52:31,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:31,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:31,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:52:31,282 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-11 11:52:31,283 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:31,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:52:31,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:52:31,590 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:52:31,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:31,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:52:31,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:31,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:52:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:31,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:52:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:31,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:52:31,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:52:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:52:31,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:52:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:52:31,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:52:31,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:52:31,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:31,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:52:31,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:52:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:52:31,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:52:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:31,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:52:31,988 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,011 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,035 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:52:32,130 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:52:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:52:32,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:52:32,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:52:32,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 11:52:32,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:52:32,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:52:32,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:52:32,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 11:52:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:52:32,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:52:32,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:52:32,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:52:32,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 11:52:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:32,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:52:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:52:32,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:52:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:52:32,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:52:32,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:52:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:52:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:52:32,569 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-11 11:52:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:52:45,846 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-11 11:52:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:52:45,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:52:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:52:45,891 INFO L225 Difference]: With dead ends: 13106 [2019-01-11 11:52:45,891 INFO L226 Difference]: Without dead ends: 13105 [2019-01-11 11:52:45,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:52:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-11 11:52:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-11 11:52:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-11 11:52:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-11 11:52:59,723 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-11 11:52:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:52:59,723 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-11 11:52:59,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:52:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-11 11:52:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:52:59,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:52:59,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:52:59,734 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:52:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:52:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-11 11:52:59,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:52:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:52:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:52:59,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:52:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:52:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:52:59,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:52:59,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:52:59,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:52:59,834 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-11 11:52:59,835 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:52:59,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:53:00,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:53:00,202 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:53:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:00,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:53:00,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:00,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:53:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:00,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:53:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:00,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:53:00,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:53:00,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:53:00,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:53:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:53:00,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:53:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:53:00,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,346 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:53:00,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:53:00,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:53:00,734 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-01-11 11:53:00,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:53:00,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:53:00,812 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,837 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,886 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,911 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:00,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:00,954 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:53:00,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:00,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:53:00,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:01,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:01,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:53:01,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,079 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:01,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:53:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:01,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:01,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 11:53:01,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:53:01,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:01,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:01,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 11:53:01,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:01,259 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:01,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:53:01,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:01,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:01,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 11:53:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:01,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:53:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:01,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:53:01,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:53:01,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:53:01,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:53:01,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:53:01,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:53:01,419 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-11 11:53:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:53:14,867 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-11 11:53:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:53:14,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:53:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:53:14,919 INFO L225 Difference]: With dead ends: 13278 [2019-01-11 11:53:14,919 INFO L226 Difference]: Without dead ends: 13277 [2019-01-11 11:53:14,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:53:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-11 11:53:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-11 11:53:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-11 11:53:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-11 11:53:28,735 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-11 11:53:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:53:28,735 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-11 11:53:28,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:53:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-11 11:53:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:53:28,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:53:28,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:53:28,747 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:53:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-11 11:53:28,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:53:28,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:28,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:28,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:28,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:53:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:28,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:28,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:53:28,925 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:53:28,925 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-11 11:53:28,926 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:53:28,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:53:29,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:53:29,270 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:53:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:29,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:53:29,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:29,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:53:29,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:29,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:53:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:29,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:53:29,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:53:29,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:53:29,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:53:29,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:53:29,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:53:29,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:53:29,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:53:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:53:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:53:29,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:53:29,580 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,611 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,626 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:29,658 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:53:29,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:53:29,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:29,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:53:29,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,773 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:29,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:53:29,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:29,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:53:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:53:29,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:29,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:53:29,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:29,906 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:29,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:53:29,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:29,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:29,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:53:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:29,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:53:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:30,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:53:30,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:53:30,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:53:30,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:53:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:53:30,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:53:30,047 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-11 11:53:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:53:47,083 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-11 11:53:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:53:47,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:53:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:53:47,152 INFO L225 Difference]: With dead ends: 17581 [2019-01-11 11:53:47,152 INFO L226 Difference]: Without dead ends: 17580 [2019-01-11 11:53:47,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:53:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-11 11:53:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-11 11:53:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 11:53:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 11:53:58,159 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 11:53:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:53:58,159 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 11:53:58,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:53:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 11:53:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:53:58,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:53:58,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:53:58,169 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:53:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-11 11:53:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:53:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:53:58,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:53:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:53:58,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:58,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:53:58,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:53:58,236 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-11 11:53:58,236 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:53:58,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:53:58,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:53:58,449 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:53:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:53:58,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:53:58,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:53:58,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:53:58,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:53:58,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:53:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:53:58,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:53:58,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:53:58,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:53:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:53:58,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:53:58,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:53:58,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:53:58,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:53:58,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:53:58,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:53:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:53:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:53:58,811 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,834 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,857 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,880 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,905 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:53:58,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:58,947 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:53:58,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:58,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:53:58,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:53:59,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:53:59,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:53:59,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:59,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:53:59,181 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:53:59,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:53:59,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:53:59,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:53:59,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-11 11:53:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:59,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:53:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:53:59,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:53:59,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:53:59,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:53:59,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:53:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:53:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:53:59,272 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-11 11:54:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:54:09,346 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-11 11:54:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:54:09,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:54:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:54:09,382 INFO L225 Difference]: With dead ends: 9947 [2019-01-11 11:54:09,382 INFO L226 Difference]: Without dead ends: 9946 [2019-01-11 11:54:09,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-01-11 11:54:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-11 11:54:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-11 11:54:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 11:54:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 11:54:20,315 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 11:54:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:54:20,315 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 11:54:20,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:54:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 11:54:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:54:20,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:54:20,323 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:54:20,324 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:54:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-11 11:54:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:54:20,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:20,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:54:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:54:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:20,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:54:20,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:54:20,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:54:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:20,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:54:20,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:54:20,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:54:20,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:54:20,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:54:20,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:54:20,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:54:20,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:54:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:54:20,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:54:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:54:20,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:54:20,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 11:54:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 11:54:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:54:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 11:54:20,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,708 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,723 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:20,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:54:20,770 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 11:54:20,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:20,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:54:20,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:54:20,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:20,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-11 11:54:21,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,087 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:21,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-11 11:54:21,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:21,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 11:54:21,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 11:54:21,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-11 11:54:21,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-11 11:54:21,660 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-11 11:54:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:21,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-11 11:54:21,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:21,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 11:54:21,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:21,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:21,954 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:21,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-11 11:54:21,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-11 11:54:22,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-11 11:54:22,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-11 11:54:22,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-11 11:54:22,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 11:54:22,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-11 11:54:22,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-11 11:54:22,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:22,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-11 11:54:22,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-11 11:54:22,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:22,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:22,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-11 11:54:22,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:23,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-11 11:54:23,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:23,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-11 11:54:23,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:23,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:23,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 11:54:23,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:23,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 11:54:23,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-11 11:54:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:54:23,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:54:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:54:23,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:54:23,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:54:23,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:54:23,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:54:23,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:54:23,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:54:23,715 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-11 11:54:23,910 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-11 11:54:24,172 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-11 11:54:24,461 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-11 11:54:25,619 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-11 11:54:27,110 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-11 11:54:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:54:39,253 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-11 11:54:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:54:39,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 11:54:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:54:39,301 INFO L225 Difference]: With dead ends: 12394 [2019-01-11 11:54:39,301 INFO L226 Difference]: Without dead ends: 12392 [2019-01-11 11:54:39,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-11 11:54:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-11 11:54:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-11 11:54:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-11 11:54:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-11 11:54:48,487 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-11 11:54:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:54:48,487 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-11 11:54:48,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:54:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-11 11:54:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:54:48,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:54:48,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:54:48,494 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:54:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-11 11:54:48,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:54:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:48,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:54:48,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:54:48,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:54:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:54:48,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:48,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:54:48,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:54:48,573 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-11 11:54:48,574 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:54:48,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:54:48,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:54:48,912 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:54:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:54:48,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:54:48,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:54:48,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:54:48,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:54:48,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:54:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:54:48,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:54:48,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:54:48,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:54:48,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:54:48,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:54:48,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:54:48,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:48,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:54:48,972 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:54:49,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:54:49,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:54:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:54:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:54:49,271 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,294 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,340 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,365 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:54:49,406 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:54:49,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:54:49,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:54:49,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:49,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 11:54:49,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-11 11:54:49,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-01-11 11:54:49,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:49,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-11 11:54:49,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,912 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 11:54:49,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:49,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:49,999 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:54:50,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:54:50,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-01-11 11:54:50,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:54:50,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:54:50,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-11 11:54:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:54:50,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:54:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:54:50,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:54:50,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:54:50,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:54:50,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:54:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:54:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:54:50,219 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-11 11:54:50,436 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-11 11:54:52,195 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-11 11:55:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:55:00,218 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-11 11:55:00,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:55:00,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:55:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:55:00,242 INFO L225 Difference]: With dead ends: 7367 [2019-01-11 11:55:00,243 INFO L226 Difference]: Without dead ends: 7366 [2019-01-11 11:55:00,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:55:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-11 11:55:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-11 11:55:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-11 11:55:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-11 11:55:09,732 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-11 11:55:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:55:09,732 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-11 11:55:09,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:55:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-11 11:55:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:55:09,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:55:09,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:55:09,739 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:55:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-11 11:55:09,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:55:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:55:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:09,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:55:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:55:09,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:09,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:55:09,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:55:09,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:55:09,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:09,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:55:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:55:09,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:55:09,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:55:09,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:55:09,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:55:09,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:55:09,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:55:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:55:09,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:55:09,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:55:09,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:09,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:55:09,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:09,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:55:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:55:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:55:10,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:55:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:55:10,292 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,317 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,342 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:10,436 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 11:55:10,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:55:10,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:10,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 11:55:10,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:55:10,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:10,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 11:55:10,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,647 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:10,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:55:10,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:10,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 11:55:10,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:10,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:10,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:55:10,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:10,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:10,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 11:55:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:55:10,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:55:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:55:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:55:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:55:10,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:55:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:55:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:55:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:55:10,871 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-11 11:55:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:55:27,045 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-11 11:55:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:55:27,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:55:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:55:27,081 INFO L225 Difference]: With dead ends: 9936 [2019-01-11 11:55:27,082 INFO L226 Difference]: Without dead ends: 9935 [2019-01-11 11:55:27,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:55:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-11 11:55:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-11 11:55:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-11 11:55:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-11 11:55:41,387 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-11 11:55:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:55:41,387 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-11 11:55:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:55:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-11 11:55:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:55:41,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:55:41,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:55:41,396 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:55:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-11 11:55:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:55:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:41,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:55:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:55:41,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:55:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:55:41,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:41,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:55:41,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:55:41,509 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-11 11:55:41,510 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:55:41,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:55:41,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:55:41,806 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:55:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:55:41,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:55:41,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:55:41,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:55:41,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:55:41,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:55:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:55:41,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:55:41,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:55:41,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:55:41,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:55:41,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:55:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:55:42,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:55:42,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:55:42,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:55:42,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:55:42,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:55:42,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:55:42,156 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,189 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,207 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,220 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,243 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:42,284 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 11:55:42,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:55:42,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:55:42,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:55:42,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 11:55:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,512 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:55:42,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:55:42,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:42,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 11:55:42,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:55:42,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:55:42,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:55:42,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:55:42,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 11:55:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:55:42,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:55:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:55:42,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:55:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:55:42,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:55:42,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:55:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:55:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:55:42,670 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-11 11:55:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:55:57,451 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-11 11:55:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:55:57,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:55:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:55:57,483 INFO L225 Difference]: With dead ends: 9235 [2019-01-11 11:55:57,483 INFO L226 Difference]: Without dead ends: 9232 [2019-01-11 11:55:57,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:55:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-11 11:56:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-11 11:56:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-11 11:56:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-11 11:56:12,710 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-11 11:56:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:56:12,710 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-11 11:56:12,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:56:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-11 11:56:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:56:12,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:56:12,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:56:12,719 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:56:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:56:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-11 11:56:12,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:56:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:56:12,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:56:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:56:12,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:56:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:56:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:56:12,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:56:12,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:56:12,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:56:12,789 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-11 11:56:12,789 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:56:12,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:56:13,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:56:13,005 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:56:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:56:13,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:56:13,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:56:13,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:56:13,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:56:13,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:56:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:56:13,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:56:13,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:56:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:56:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:56:13,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:56:13,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:56:13,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:56:13,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:56:13,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:56:13,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:56:13,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:56:13,224 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,248 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,266 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,279 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:13,330 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 11:56:13,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:56:13,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:56:13,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 11:56:13,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 11:56:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:13,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:56:13,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 11:56:13,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:13,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:13,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-11 11:56:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:56:13,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:56:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:56:13,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:56:13,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:56:13,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:56:13,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:56:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:56:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:56:13,587 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-11 11:56:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:56:27,559 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-11 11:56:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:56:27,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:56:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:56:27,594 INFO L225 Difference]: With dead ends: 9065 [2019-01-11 11:56:27,594 INFO L226 Difference]: Without dead ends: 9064 [2019-01-11 11:56:27,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:56:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-11 11:56:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-11 11:56:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-11 11:56:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-11 11:56:42,431 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-11 11:56:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:56:42,431 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-11 11:56:42,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:56:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-11 11:56:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:56:42,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:56:42,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:56:42,439 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:56:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:56:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-11 11:56:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:56:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:56:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:56:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:56:42,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:56:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:56:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:56:42,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:56:42,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:56:42,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:56:42,521 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-11 11:56:42,522 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:56:42,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:56:42,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:56:42,943 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-11 11:56:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:56:42,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:56:42,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:56:42,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:56:42,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:56:42,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:56:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:56:42,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:56:42,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:42,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:56:43,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:56:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:56:43,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:56:43,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:56:43,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:56:43,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:56:43,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:56:43,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:56:43,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:56:43,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:56:43,380 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,414 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,433 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,448 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,461 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,471 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,514 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-11 11:56:43,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:56:43,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:43,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-11 11:56:43,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:56:43,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:43,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-11 11:56:43,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,794 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:56:43,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:56:43,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:43,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-11 11:56:43,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,888 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:56:43,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-11 11:56:43,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:43,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:43,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-11 11:56:43,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:43,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:56:44,011 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:56:44,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-11 11:56:44,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:56:44,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:56:44,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-11 11:56:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:56:44,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:56:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:56:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:56:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:56:44,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:56:44,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:56:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:56:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:56:44,199 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-11 11:57:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:57:06,099 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-11 11:57:06,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:57:06,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:57:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:57:06,132 INFO L225 Difference]: With dead ends: 9411 [2019-01-11 11:57:06,132 INFO L226 Difference]: Without dead ends: 9409 [2019-01-11 11:57:06,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:57:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-11 11:57:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-11 11:57:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-11 11:57:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-11 11:57:20,278 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-11 11:57:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:57:20,279 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-11 11:57:20,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:57:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-11 11:57:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:57:20,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:57:20,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:57:20,288 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:57:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:57:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-11 11:57:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:57:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:57:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:57:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:57:20,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:57:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:57:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:20,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:57:20,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:57:20,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:57:20,430 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-11 11:57:20,431 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:57:20,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:57:20,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:57:20,854 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-11 11:57:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:57:20,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:57:20,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:57:20,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:57:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:57:20,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:57:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:57:20,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:57:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-11 11:57:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 11:57:20,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:20,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 11:57:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 11:57:21,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-11 11:57:21,095 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:57:21,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:57:21,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:57:21,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:57:21,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:57:21,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:57:21,248 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,281 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,300 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,328 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,383 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 11:57:21,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:57:21,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 11:57:21,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,518 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:57:21,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:57:21,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-11 11:57:21,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:57:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-11 11:57:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,703 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:57:21,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-11 11:57:21,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-11 11:57:21,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,797 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:57:21,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:21,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-11 11:57:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:21,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:21,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-11 11:57:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:21,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:57:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:21,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:57:21,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:57:21,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:57:21,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:57:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:57:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:57:21,972 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-01-11 11:57:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:57:37,717 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-01-11 11:57:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:57:37,717 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:57:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:57:37,744 INFO L225 Difference]: With dead ends: 8797 [2019-01-11 11:57:37,744 INFO L226 Difference]: Without dead ends: 8791 [2019-01-11 11:57:37,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:57:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-01-11 11:57:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-01-11 11:57:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-01-11 11:57:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-01-11 11:57:45,815 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-01-11 11:57:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:57:45,815 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-01-11 11:57:45,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:57:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-01-11 11:57:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:57:45,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:57:45,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:57:45,818 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:57:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:57:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-01-11 11:57:45,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:57:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:57:45,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:57:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:57:45,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:57:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:57:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:45,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:57:45,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:57:45,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:57:45,881 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-01-11 11:57:45,882 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:57:45,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:57:46,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:57:46,181 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:57:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:57:46,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:57:46,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:57:46,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:57:46,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:57:46,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:57:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:57:46,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:57:46,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 11:57:46,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 11:57:46,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 11:57:46,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 11:57:46,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:57:46,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:57:46,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:57:46,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:57:46,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:57:46,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:57:46,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 11:57:46,522 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,555 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,573 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,587 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,598 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,609 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:46,650 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 11:57:46,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 11:57:46,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:46,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 11:57:46,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 11:57:46,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:57:46,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:57:46,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 11:57:46,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:57:46,846 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:57:46,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:57:46,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:57:47,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 11:57:47,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-01-11 11:57:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:47,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:57:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:57:47,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:57:47,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:57:47,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:57:47,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:57:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:57:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:57:47,109 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-01-11 11:57:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:57:56,993 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-01-11 11:57:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:57:56,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:57:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:57:56,998 INFO L225 Difference]: With dead ends: 1963 [2019-01-11 11:57:56,998 INFO L226 Difference]: Without dead ends: 1962 [2019-01-11 11:57:56,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:57:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-01-11 11:58:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-01-11 11:58:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-01-11 11:58:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-01-11 11:58:04,836 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-01-11 11:58:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:58:04,836 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-01-11 11:58:04,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:58:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-01-11 11:58:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:58:04,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:58:04,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:58:04,840 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:58:04,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:58:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-01-11 11:58:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:58:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:58:04,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:58:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:58:04,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:58:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:58:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:58:04,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:58:04,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:58:04,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:58:04,987 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-01-11 11:58:04,988 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 11:58:04,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:58:05,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:58:05,262 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:58:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:58:05,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:58:05,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:58:05,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:58:05,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:58:05,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:58:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:58:05,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:58:05,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:58:05,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:58:05,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:58:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:58:05,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 11:58:05,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 11:58:05,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 11:58:05,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 11:58:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 11:58:05,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 11:58:05,523 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,537 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,551 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:58:05,595 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 11:58:05,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:58:05,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:58:05,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:58:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:58:05,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:58:05,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:58:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:58:05,737 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:58:05,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 11:58:05,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:58:05,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:58:05,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:58:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:58:05,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:58:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:58:05,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:58:05,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-01-11 11:58:05,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:58:05,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:58:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:58:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:58:05,839 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-01-11 11:58:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:58:13,655 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-01-11 11:58:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:58:13,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:58:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:58:13,660 INFO L225 Difference]: With dead ends: 2000 [2019-01-11 11:58:13,660 INFO L226 Difference]: Without dead ends: 1999 [2019-01-11 11:58:13,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:58:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states.