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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:34:24,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:34:24,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:34:24,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:34:24,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:34:24,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:34:24,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:34:24,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:34:24,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:34:24,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:34:24,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:34:24,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:34:24,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:34:24,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:34:24,419 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:34:24,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:34:24,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:34:24,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:34:24,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:34:24,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:34:24,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:34:24,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:34:24,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:34:24,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:34:24,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:34:24,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:34:24,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:34:24,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:34:24,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:34:24,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:34:24,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:34:24,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:34:24,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:34:24,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:34:24,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:34:24,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:34:24,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 17:34:24,472 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:34:24,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:34:24,475 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:34:24,475 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:34:24,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:34:24,475 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:34:24,475 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:34:24,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:34:24,476 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:34:24,476 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:34:24,477 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:34:24,477 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:34:24,477 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:34:24,477 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:34:24,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:34:24,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:34:24,478 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:34:24,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:34:24,480 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:34:24,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:34:24,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:34:24,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:34:24,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:34:24,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:34:24,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:34:24,482 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:34:24,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:34:24,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:34:24,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:34:24,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:34:24,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:34:24,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:34:24,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:34:24,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:34:24,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:34:24,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:34:24,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:34:24,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:34:24,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:34:24,485 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:34:24,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:34:24,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:34:24,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:34:24,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:34:24,540 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:34:24,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-18 17:34:24,541 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-18 17:34:24,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:34:24,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:34:24,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:34:24,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:34:24,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:34:24,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:34:24,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:34:24,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:34:24,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:34:24,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... [2019-01-18 17:34:24,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:34:24,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:34:24,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:34:24,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:34:24,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:34:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:34:24,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:34:25,050 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:34:25,050 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-18 17:34:25,052 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:34:25 BoogieIcfgContainer [2019-01-18 17:34:25,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:34:25,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:34:25,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:34:25,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:34:25,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:34:24" (1/2) ... [2019-01-18 17:34:25,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9ce322 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:34:25, skipping insertion in model container [2019-01-18 17:34:25,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:34:25" (2/2) ... [2019-01-18 17:34:25,060 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-18 17:34:25,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:34:25,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-18 17:34:25,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-18 17:34:25,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:34:25,127 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:34:25,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:34:25,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:34:25,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:34:25,128 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:34:25,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:34:25,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:34:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-18 17:34:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 17:34:25,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:25,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 17:34:25,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-18 17:34:25,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:25,351 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-18 17:34:25,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:34:25,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:34:25,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:25,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:34:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:34:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:34:25,370 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-18 17:34:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:25,634 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-18 17:34:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:25,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 17:34:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:25,648 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:34:25,649 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:34:25,652 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-18 17:34:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:34:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-18 17:34:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:34:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-18 17:34:25,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-18 17:34:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:25,691 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-18 17:34:25,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:34:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-18 17:34:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:34:25,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:25,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:34:25,693 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-18 17:34:25,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:25,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:25,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:25,854 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-18 17:34:25,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:25,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:25,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:34:25,857 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-18 17:34:25,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:25,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:25,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:25,982 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:25,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:25,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:25,988 INFO 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-18 17:34:26,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:26,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:26,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:26,117 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 18 treesize of output 21 [2019-01-18 17:34:26,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,164 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 21 treesize of output 27 [2019-01-18 17:34:26,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,233 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 23 treesize of output 37 [2019-01-18 17:34:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,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 25 treesize of output 51 [2019-01-18 17:34:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,316 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:26,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:26,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:26,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:26,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:26,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:26,889 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-18 17:34:26,889 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:26,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:26,996 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-18 17:34:26,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:27,094 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-18 17:34:27,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:27,182 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-18 17:34:27,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:27,238 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-18 17:34:27,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:27,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:27,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:27,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:27,261 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-18 17:34:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:27,952 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-18 17:34:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:27,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:34:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:27,954 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:34:27,954 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:34:27,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:34:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:34:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-18 17:34:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:34:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-18 17:34:27,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-18 17:34:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:27,962 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-18 17:34:27,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-18 17:34:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:34:27,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:27,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:34:27,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-18 17:34:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:27,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:27,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,045 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-18 17:34:28,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:28,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:34:28,047 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-18 17:34:28,048 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:28,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:28,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:28,057 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:28,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:28,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:28,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:28,099 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 18 treesize of output 21 [2019-01-18 17:34:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,120 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 23 treesize of output 37 [2019-01-18 17:34:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,135 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 25 treesize of output 51 [2019-01-18 17:34:28,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,161 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:28,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,287 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-18 17:34:28,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:34:28,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:28,434 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-18 17:34:28,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:28,468 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-18 17:34:28,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:28,484 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-18 17:34:28,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:34:28,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:34:28,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:28,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:34:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:34:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:28,506 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-18 17:34:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:28,598 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-18 17:34:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:28,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:34:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:28,600 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:34:28,600 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:34:28,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:34:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:34:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:34:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-18 17:34:28,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-18 17:34:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:28,606 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-18 17:34:28,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:34:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-18 17:34:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:34:28,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:28,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:34:28,607 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-18 17:34:28,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,704 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-18 17:34:28,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:34:28,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:34:28,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:28,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:34:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:34:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:34:28,706 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-18 17:34:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:28,799 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-18 17:34:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:34:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:28,800 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:34:28,801 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:34:28,801 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-18 17:34:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:34:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-18 17:34:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:34:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-18 17:34:28,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-18 17:34:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:28,806 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-18 17:34:28,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:34:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-18 17:34:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:34:28,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:28,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:34:28,807 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:28,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:28,807 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-18 17:34:28,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:28,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:28,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,943 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-18 17:34:28,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:28,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:34:28,945 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-18 17:34:28,950 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:28,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:28,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:28,959 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:28,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:28,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:28,959 INFO 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-18 17:34:28,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:28,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:28,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:28,982 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 18 treesize of output 21 [2019-01-18 17:34:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,989 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 21 treesize of output 27 [2019-01-18 17:34:28,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:28,999 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 23 treesize of output 37 [2019-01-18 17:34:29,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,007 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 25 treesize of output 51 [2019-01-18 17:34:29,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:29,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,248 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-18 17:34:29,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:29,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,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, 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-18 17:34:29,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:29,374 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-18 17:34:29,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:29,424 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-18 17:34:29,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:29,455 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-18 17:34:29,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:29,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:29,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:29,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:29,474 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-18 17:34:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:29,742 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-18 17:34:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:29,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:34:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:29,743 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:34:29,744 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:34:29,744 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-18 17:34:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:34:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-18 17:34:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:34:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-18 17:34:29,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-18 17:34:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:29,750 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-18 17:34:29,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-18 17:34:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:29,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:29,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:29,751 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-18 17:34:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:29,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:29,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:29,872 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-18 17:34:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:29,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:29,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:29,873 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-18 17:34:29,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:29,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:29,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:29,882 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:29,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:29,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:29,883 INFO 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-18 17:34:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:29,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:29,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:29,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:29,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:34:29,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:29,962 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 25 treesize of output 51 [2019-01-18 17:34:30,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:30,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,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-18 17:34:30,151 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:30,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,232 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-18 17:34:30,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,283 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-18 17:34:30,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:30,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:30,418 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-18 17:34:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:30,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:30,488 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-18 17:34:30,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:30,520 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-18 17:34:30,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:30,558 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-18 17:34:30,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:30,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:30,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:30,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:30,579 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-18 17:34:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:31,131 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-18 17:34:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:31,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:31,133 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:34:31,134 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:34:31,135 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-18 17:34:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:34:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-18 17:34:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:34:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-18 17:34:31,141 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-18 17:34:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:31,142 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-18 17:34:31,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-18 17:34:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:31,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:31,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:31,142 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-18 17:34:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:31,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:31,271 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-18 17:34:31,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:31,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:31,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:31,271 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-18 17:34:31,275 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:31,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:31,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:31,284 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:31,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:31,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:31,285 INFO 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-18 17:34:31,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:31,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:31,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:31,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,317 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 21 treesize of output 27 [2019-01-18 17:34:31,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,326 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 23 treesize of output 37 [2019-01-18 17:34:31,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,342 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 25 treesize of output 51 [2019-01-18 17:34:31,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:31,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,447 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-18 17:34:31,448 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:31,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,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, 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-18 17:34:31,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,593 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-18 17:34:31,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:31,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:31,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, 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-18 17:34:31,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:31,790 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-18 17:34:31,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:31,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-18 17:34:31,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:31,833 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-18 17:34:31,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:31,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:34:31,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:31,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:34:31,853 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-18 17:34:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:32,482 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-18 17:34:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:32,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:32,485 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:34:32,485 INFO L226 Difference]: Without dead ends: 46 [2019-01-18 17:34:32,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-18 17:34:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-18 17:34:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:34:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-18 17:34:32,493 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-18 17:34:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:32,493 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-18 17:34:32,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-18 17:34:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:32,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:32,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:32,494 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-18 17:34:32,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:32,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:32,551 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-18 17:34:32,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:32,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:32,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:32,552 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-18 17:34:32,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:32,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:32,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:32,567 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:32,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:32,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:32,567 INFO 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-18 17:34:32,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:32,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:32,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:34:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:32,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:32,649 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,722 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-18 17:34:32,722 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:32,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:32,779 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-18 17:34:32,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:32,828 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-18 17:34:32,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:32,847 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-18 17:34:32,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:32,857 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-18 17:34:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:34:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:34:32,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:32,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:34:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:34:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:32,876 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-18 17:34:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:32,921 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-18 17:34:32,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:32,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:34:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:32,922 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:34:32,922 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:34:32,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:34:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-18 17:34:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:34:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-18 17:34:32,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-18 17:34:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:32,930 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-18 17:34:32,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:34:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-18 17:34:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:32,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:32,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:32,932 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-18 17:34:32,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:32,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:33,100 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-18 17:34:33,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:33,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:33,101 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:33,101 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-18 17:34:33,102 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:33,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:33,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:33,108 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:33,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:33,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:33,109 INFO 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-18 17:34:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:33,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:33,139 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 18 treesize of output 21 [2019-01-18 17:34:33,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:33,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,161 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 23 treesize of output 37 [2019-01-18 17:34:33,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:34:33,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:33,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,288 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-18 17:34:33,289 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:33,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:34:33,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,398 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-18 17:34:33,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:33,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:33,462 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:33,464 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-18 17:34:33,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:33,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:34:33,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:34:33,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-18 17:34:33,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:33,578 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-18 17:34:33,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:33,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:33,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:33,598 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-18 17:34:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:34,020 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-18 17:34:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:34,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:34,022 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:34:34,022 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:34:34,023 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-18 17:34:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:34:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-18 17:34:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:34:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-18 17:34:34,030 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-18 17:34:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:34,030 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-18 17:34:34,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-18 17:34:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:34,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:34,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:34,031 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-18 17:34:34,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:34,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:34,081 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-18 17:34:34,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:34,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:34,082 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:34,082 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-18 17:34:34,085 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:34,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:34,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:34,091 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:34,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:34,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:34,092 INFO 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-18 17:34:34,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:34,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:34,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:34,122 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 18 treesize of output 21 [2019-01-18 17:34:34,171 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 21 treesize of output 23 [2019-01-18 17:34:34,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:34,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,206 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:34,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,275 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-18 17:34:34,275 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,311 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-18 17:34:34,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:34,343 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-18 17:34:34,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:34,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:34,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:34,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:34,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:34,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:34,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:34,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:34,392 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-18 17:34:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:34,698 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-18 17:34:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:34,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:34:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:34,699 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:34:34,700 INFO L226 Difference]: Without dead ends: 42 [2019-01-18 17:34:34,700 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-18 17:34:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-18 17:34:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-18 17:34:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:34:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-18 17:34:34,709 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-18 17:34:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:34,709 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-18 17:34:34,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-18 17:34:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:34,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:34,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:34,710 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-18 17:34:34,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:34,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:34,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:34,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:34,861 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-18 17:34:34,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:34,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:34,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:34,862 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-18 17:34:34,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:34,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:34,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:34,871 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:34,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:34,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:34,873 INFO 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-18 17:34:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:34,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:34,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:34,902 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 18 treesize of output 21 [2019-01-18 17:34:34,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:34,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,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 23 treesize of output 37 [2019-01-18 17:34:34,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,945 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 25 treesize of output 51 [2019-01-18 17:34:34,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:34,962 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:34,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,068 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-18 17:34:35,068 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,114 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-18 17:34:35,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,158 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-18 17:34:35,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:35,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,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-18 17:34:35,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:35,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:35,294 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-18 17:34:35,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:35,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:35,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:35,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:35,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:35,314 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-18 17:34:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:35,739 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-18 17:34:35,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:35,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:35,741 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:34:35,741 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:34:35,742 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-18 17:34:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:34:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-18 17:34:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:34:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-18 17:34:35,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-18 17:34:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:35,751 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-18 17:34:35,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-18 17:34:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:35,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:35,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:35,752 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-18 17:34:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:35,867 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-18 17:34:35,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:35,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:35,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:35,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:35,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:35,868 INFO 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-18 17:34:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:35,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:35,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:34:35,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:35,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:35,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:35,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:35,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,902 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 23 treesize of output 37 [2019-01-18 17:34:35,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,914 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 25 treesize of output 51 [2019-01-18 17:34:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:35,928 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:35,928 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,956 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:35,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,021 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-18 17:34:36,021 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:36,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:36,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,220 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-18 17:34:36,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:36,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,256 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-18 17:34:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,303 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-18 17:34:36,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:36,329 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-18 17:34:36,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:36,383 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-18 17:34:36,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:36,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:34:36,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:36,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:36,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:34:36,405 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-18 17:34:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:36,780 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-18 17:34:36,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:34:36,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:36,781 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:34:36,781 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:34:36,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-18 17:34:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:34:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-18 17:34:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:34:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-18 17:34:36,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-18 17:34:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:36,791 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-18 17:34:36,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-18 17:34:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:36,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:36,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:36,792 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-18 17:34:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:36,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:36,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:36,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:36,867 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-18 17:34:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:36,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:36,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:36,868 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-18 17:34:36,869 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:36,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:36,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:36,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:36,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:36,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:36,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:36,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:36,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:36,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:36,902 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 18 treesize of output 21 [2019-01-18 17:34:36,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,909 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 21 treesize of output 27 [2019-01-18 17:34:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,914 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 23 treesize of output 37 [2019-01-18 17:34:36,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,922 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 25 treesize of output 51 [2019-01-18 17:34:36,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:36,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:36,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:36,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,020 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-18 17:34:37,021 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:37,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,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-18 17:34:37,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,109 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-18 17:34:37,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:37,125 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-18 17:34:37,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:37,137 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-18 17:34:37,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:37,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:37,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:37,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:37,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:37,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:37,157 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-18 17:34:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:37,350 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-18 17:34:37,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:37,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:34:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:37,352 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:34:37,352 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:34:37,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-18 17:34:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:34:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-18 17:34:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:34:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-18 17:34:37,362 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-18 17:34:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:37,362 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-18 17:34:37,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-18 17:34:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:37,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:37,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:37,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:37,363 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-18 17:34:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:37,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:37,385 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-18 17:34:37,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:34:37,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:34:37,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:37,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:34:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:34:37,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:34:37,386 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-18 17:34:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:37,429 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-18 17:34:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:37,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 17:34:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:37,431 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:34:37,431 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:34:37,431 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-18 17:34:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:34:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:34:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:34:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-18 17:34:37,440 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-18 17:34:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:37,440 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-18 17:34:37,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:34:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-18 17:34:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:37,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:37,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:37,442 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-18 17:34:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:37,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:37,658 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-18 17:34:37,665 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-18 17:34:37,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:37,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:37,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:37,667 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-18 17:34:37,668 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:37,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:37,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:37,674 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:37,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:37,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:37,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:37,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:37,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:37,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:37,702 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 18 treesize of output 21 [2019-01-18 17:34:37,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,711 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 21 treesize of output 27 [2019-01-18 17:34:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:34:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:34:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,751 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:37,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,835 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-18 17:34:37,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:37,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,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, 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-18 17:34:37,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:37,927 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-18 17:34:37,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:37,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:37,968 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-18 17:34:37,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,035 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-18 17:34:38,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:38,052 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-18 17:34:38,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:38,064 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-18 17:34:38,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:38,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:34:38,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:38,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:34:38,086 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-18 17:34:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:38,461 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-18 17:34:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:38,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:38,463 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:34:38,463 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:34:38,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:34:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-18 17:34:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:34:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-18 17:34:38,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-18 17:34:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:38,473 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-18 17:34:38,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-18 17:34:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:38,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:38,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:38,474 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-18 17:34:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:38,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:38,564 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-18 17:34:38,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:38,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:38,564 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:38,565 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-18 17:34:38,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:38,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:38,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:38,572 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:38,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:38,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:38,573 INFO 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-18 17:34:38,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:38,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:38,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:34:38,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:38,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,637 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:38,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,705 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-18 17:34:38,705 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:38,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:38,743 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-18 17:34:38,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:38,774 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-18 17:34:38,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:38,787 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-18 17:34:38,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:38,797 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-18 17:34:38,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:38,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:38,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:38,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:38,817 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-18 17:34:39,252 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-18 17:34:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:39,722 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-18 17:34:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:39,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:34:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:39,723 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:34:39,723 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:34:39,724 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-18 17:34:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:34:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-18 17:34:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:34:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-18 17:34:39,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-18 17:34:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:39,734 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-18 17:34:39,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-18 17:34:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:34:39,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:39,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:34:39,735 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-18 17:34:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:39,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:39,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:39,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:39,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:34:39,881 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-18 17:34:39,882 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:39,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:39,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:39,886 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:39,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:39,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:39,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:39,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:39,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:39,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:39,909 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 18 treesize of output 21 [2019-01-18 17:34:39,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,912 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 21 treesize of output 27 [2019-01-18 17:34:39,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,928 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 23 treesize of output 37 [2019-01-18 17:34:39,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,936 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 25 treesize of output 51 [2019-01-18 17:34:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:39,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:39,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:39,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:39,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:40,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:40,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:40,038 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-18 17:34:40,038 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:40,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,095 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-18 17:34:40,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:40,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-18 17:34:40,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:40,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:40,216 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-18 17:34:40,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:40,694 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-18 17:34:40,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:40,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-18 17:34:40,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:40,749 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-18 17:34:40,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:40,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:40,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:40,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:40,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:40,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:40,770 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-18 17:34:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:41,276 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-18 17:34:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:41,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:34:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:41,278 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:34:41,278 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:34:41,279 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-18 17:34:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:34:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-18 17:34:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:34:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-18 17:34:41,287 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-18 17:34:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:41,287 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-18 17:34:41,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-18 17:34:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:41,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:41,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:41,288 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-18 17:34:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:41,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:41,548 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-18 17:34:41,572 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-18 17:34:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:41,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:41,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:41,572 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-18 17:34:41,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:41,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:41,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:41,578 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:41,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:41,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:41,578 INFO 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-18 17:34:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:41,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:41,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:41,599 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 18 treesize of output 21 [2019-01-18 17:34:41,611 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 21 treesize of output 23 [2019-01-18 17:34:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:41,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,644 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:41,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,718 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-18 17:34:41,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,788 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-18 17:34:41,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,821 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-18 17:34:41,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:41,849 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 59 [2019-01-18 17:34:41,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:41,878 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-18 17:34:41,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:34:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:41,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:41,940 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-18 17:34:41,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:41,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:41,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:41,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:41,960 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-18 17:34:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:42,296 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-18 17:34:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:42,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:42,298 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:34:42,298 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:34:42,299 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-18 17:34:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:34:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-18 17:34:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:34:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-18 17:34:42,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-18 17:34:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:42,308 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-18 17:34:42,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-18 17:34:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:42,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:42,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:42,309 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-18 17:34:42,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:42,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:42,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:42,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:42,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:42,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:42,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:42,449 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-18 17:34:42,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:42,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:42,456 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:42,456 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:34:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:42,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:42,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:42,457 INFO 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-18 17:34:42,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:42,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:42,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:42,491 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 18 treesize of output 21 [2019-01-18 17:34:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,494 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 21 treesize of output 27 [2019-01-18 17:34:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:34:42,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,597 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 25 treesize of output 51 [2019-01-18 17:34:42,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,710 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-18 17:34:42,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:42,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,897 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-18 17:34:42,897 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,932 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-18 17:34:42,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,972 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-18 17:34:42,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:42,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,009 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-18 17:34:43,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:43,053 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-18 17:34:43,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:43,099 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-18 17:34:43,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:43,149 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-18 17:34:43,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:34:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:43,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:43,233 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-18 17:34:43,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:43,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:34:43,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:34:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:34:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:34:43,254 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-18 17:34:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:44,311 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-18 17:34:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:44,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:34:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:44,313 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:34:44,313 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:34:44,314 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-18 17:34:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:34:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-18 17:34:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:34:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-18 17:34:44,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-18 17:34:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:44,334 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-18 17:34:44,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:34:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-18 17:34:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:44,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:44,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:44,335 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-18 17:34:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:44,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:44,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-18 17:34:44,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:44,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:44,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:44,503 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-18 17:34:44,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:44,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:44,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:44,509 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:44,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:44,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:44,510 INFO 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-18 17:34:44,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:44,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:44,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:44,532 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 18 treesize of output 21 [2019-01-18 17:34:44,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,536 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 21 treesize of output 27 [2019-01-18 17:34:44,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,545 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 23 treesize of output 37 [2019-01-18 17:34:44,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,551 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 25 treesize of output 51 [2019-01-18 17:34:44,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:44,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,761 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-18 17:34:44,762 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:44,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:34:44,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:44,885 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-18 17:34:44,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:44,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:44,946 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-18 17:34:44,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:34:45,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:45,027 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-18 17:34:45,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:45,048 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-18 17:34:45,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:45,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:45,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:45,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:45,068 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-18 17:34:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:45,436 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-18 17:34:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:45,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:45,437 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:34:45,437 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:34:45,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-18 17:34:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:34:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-18 17:34:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:34:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-18 17:34:45,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-18 17:34:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:45,449 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-18 17:34:45,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-18 17:34:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:45,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:45,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:45,451 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-18 17:34:45,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:45,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:45,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:45,505 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-18 17:34:45,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:45,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:45,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:45,506 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-18 17:34:45,507 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:45,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:45,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:45,511 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:45,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:45,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:45,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:45,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:45,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:45,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:45,535 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 18 treesize of output 21 [2019-01-18 17:34:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:34:45,550 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 23 treesize of output 25 [2019-01-18 17:34:45,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:34:45,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:34:45,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,630 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-18 17:34:45,631 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-18 17:34:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:34:45,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:45,680 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-18 17:34:45,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:34:45,693 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-18 17:34:45,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:45,702 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-18 17:34:45,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:45,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:34:45,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:45,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:34:45,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:34:45,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:45,721 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-18 17:34:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:45,852 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-18 17:34:45,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:34:45,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-18 17:34:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:45,854 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:34:45,854 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:34:45,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:34:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:34:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-18 17:34:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:34:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-18 17:34:45,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-18 17:34:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:45,865 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-18 17:34:45,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:34:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-18 17:34:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:45,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:45,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:45,866 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-18 17:34:45,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:45,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:45,957 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-18 17:34:45,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:45,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:45,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:45,958 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-18 17:34:45,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:45,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:45,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:45,962 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:34:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:45,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:45,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:45,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:45,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:45,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:45,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:45,985 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 18 treesize of output 21 [2019-01-18 17:34:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,990 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 21 treesize of output 27 [2019-01-18 17:34:45,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:45,999 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 23 treesize of output 37 [2019-01-18 17:34:46,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,007 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 25 treesize of output 51 [2019-01-18 17:34:46,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,025 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:46,026 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,114 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-18 17:34:46,115 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:46,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,156 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-18 17:34:46,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,193 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-18 17:34:46,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:46,290 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-18 17:34:46,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,335 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-18 17:34:46,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:34:46,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:46,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:46,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:46,421 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-18 17:34:46,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:34:46,440 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-18 17:34:46,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:46,480 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-18 17:34:46,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:46,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:34:46,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:46,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:34:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:34:46,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:34:46,500 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-18 17:34:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:47,122 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-18 17:34:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:34:47,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:34:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:47,125 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:34:47,125 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:34:47,126 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-18 17:34:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:34:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-18 17:34:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:34:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-18 17:34:47,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-18 17:34:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:47,137 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-18 17:34:47,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:34:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-18 17:34:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:47,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:47,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:47,138 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-18 17:34:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:47,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:47,242 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-18 17:34:47,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:47,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:47,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:47,242 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-18 17:34:47,245 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:47,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:47,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:47,249 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:47,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:47,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:47,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:47,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:47,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:47,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:47,288 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 18 treesize of output 21 [2019-01-18 17:34:47,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 21 treesize of output 23 [2019-01-18 17:34:47,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:47,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:47,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:47,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,413 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-18 17:34:47,413 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,454 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-18 17:34:47,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,481 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-18 17:34:47,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:47,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:47,553 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-18 17:34:47,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:47,635 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-18 17:34:47,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:34:47,651 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-18 17:34:47,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:47,677 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-18 17:34:47,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:47,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:47,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:47,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:47,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:47,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:47,696 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-18 17:34:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:48,041 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-18 17:34:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:48,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:48,042 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:34:48,042 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:34:48,042 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-18 17:34:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:34:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-18 17:34:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:34:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-18 17:34:48,053 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-18 17:34:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:48,053 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-18 17:34:48,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-18 17:34:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:48,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:48,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:48,054 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:48,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-18 17:34:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:48,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:48,406 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-18 17:34:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:48,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:48,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:48,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:48,434 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-18 17:34:48,435 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:48,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:48,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:48,438 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:34:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:48,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:48,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:48,439 INFO 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-18 17:34:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:48,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:48,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:48,455 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 18 treesize of output 21 [2019-01-18 17:34:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,469 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 21 treesize of output 27 [2019-01-18 17:34:48,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:34:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,480 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 25 treesize of output 51 [2019-01-18 17:34:48,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,488 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:48,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,570 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-18 17:34:48,571 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:48,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:34:48,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,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-18 17:34:48,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:48,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,724 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-18 17:34:48,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,770 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-18 17:34:48,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:48,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:48,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, 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-18 17:34:48,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:48,959 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-18 17:34:48,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:34:48,992 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-18 17:34:48,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:49,029 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-18 17:34:49,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:49,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:34:49,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:49,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:34:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:34:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:34:49,049 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-18 17:34:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:49,807 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-18 17:34:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:49,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:34:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:49,808 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:34:49,808 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:34:49,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:34:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:34:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-18 17:34:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:34:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-18 17:34:49,818 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-18 17:34:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:49,818 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-18 17:34:49,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:34:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-18 17:34:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:49,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:49,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:49,819 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-18 17:34:49,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:49,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:49,979 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-18 17:34:49,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:49,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:49,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:49,980 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-18 17:34:49,981 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:49,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:49,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:49,984 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:49,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:49,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:49,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:49,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:50,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:50,009 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 18 treesize of output 21 [2019-01-18 17:34:50,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:50,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,020 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 23 treesize of output 37 [2019-01-18 17:34:50,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,026 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 25 treesize of output 51 [2019-01-18 17:34:50,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:50,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,133 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-18 17:34:50,133 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:50,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,165 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-18 17:34:50,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:50,207 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-18 17:34:50,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:50,409 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-18 17:34:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:50,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:50,704 INFO L303 Elim1Store]: Index analysis took 292 ms [2019-01-18 17:34:50,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:34:50,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:51,217 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-18 17:34:51,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:51,416 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-18 17:34:51,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:51,576 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-18 17:34:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:51,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:51,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:51,595 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-18 17:34:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:51,940 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-18 17:34:51,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:51,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:51,941 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:34:51,941 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:34:51,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:34:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:34:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-18 17:34:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:34:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-18 17:34:51,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-18 17:34:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:51,954 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-18 17:34:51,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-18 17:34:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:51,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:51,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:51,955 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:51,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-18 17:34:51,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:51,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:51,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:51,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:52,139 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-18 17:34:52,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:52,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:52,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:52,140 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-18 17:34:52,141 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:52,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:52,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:52,144 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:34:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:52,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:52,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:52,144 INFO 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-18 17:34:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:52,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:52,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:52,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 18 treesize of output 21 [2019-01-18 17:34:52,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,184 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 21 treesize of output 27 [2019-01-18 17:34:52,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,193 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 23 treesize of output 37 [2019-01-18 17:34:52,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,209 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 25 treesize of output 51 [2019-01-18 17:34:52,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:52,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,305 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-18 17:34:52,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:52,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,337 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-18 17:34:52,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,379 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-18 17:34:52,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:52,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:52,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:52,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,460 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-18 17:34:52,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:52,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:52,506 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-18 17:34:52,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:52,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:34:52,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:52,575 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-18 17:34:52,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:52,610 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-18 17:34:52,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:52,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:34:52,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:52,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:34:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:34:52,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:34:52,629 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-18 17:34:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:53,259 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-18 17:34:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:34:53,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:34:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:53,261 INFO L225 Difference]: With dead ends: 93 [2019-01-18 17:34:53,261 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:34:53,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:34:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:34:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-18 17:34:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:34:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-18 17:34:53,273 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-18 17:34:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:53,273 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-18 17:34:53,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:34:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-18 17:34:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:53,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:53,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:53,274 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-18 17:34:53,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:53,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:53,470 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-18 17:34:53,546 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-18 17:34:53,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:53,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:53,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:53,547 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-18 17:34:53,548 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:53,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:53,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:53,557 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:34:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:53,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:53,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:53,558 INFO 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-18 17:34:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:53,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:53,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:53,612 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 18 treesize of output 21 [2019-01-18 17:34:53,649 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 21 treesize of output 23 [2019-01-18 17:34:53,670 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 23 treesize of output 25 [2019-01-18 17:34:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:34:53,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:34:53,689 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,747 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-18 17:34:53,748 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-18 17:34:53,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:53,773 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:34:53,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:53,790 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-18 17:34:53,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:34:53,802 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-18 17:34:53,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:53,811 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-18 17:34:53,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:34:53,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:34:53,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:34:53,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:34:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:34:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:53,831 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-18 17:34:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:53,875 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-18 17:34:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:34:53,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:34:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:53,877 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:34:53,877 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:34:53,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:34:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:34:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-18 17:34:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:34:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-18 17:34:53,891 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-18 17:34:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:53,891 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-18 17:34:53,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:34:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-18 17:34:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:53,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:53,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:53,892 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-18 17:34:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:53,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:53,971 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-18 17:34:53,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:53,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:53,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:53,972 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-18 17:34:53,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:53,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:53,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:53,976 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:53,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:53,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:53,977 INFO 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-18 17:34:53,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:53,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:53,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:53,993 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 18 treesize of output 21 [2019-01-18 17:34:53,999 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 21 treesize of output 23 [2019-01-18 17:34:54,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:54,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:54,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:54,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:54,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:54,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:54,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:54,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:54,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:54,112 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-18 17:34:54,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:54,997 WARN L181 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 17:34:55,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,016 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-18 17:34:55,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:34:55,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:55,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,139 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-18 17:34:55,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,183 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-18 17:34:55,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:55,210 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-18 17:34:55,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:55,247 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-18 17:34:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:55,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:55,267 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-18 17:34:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:55,611 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-18 17:34:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:55,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:55,613 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:34:55,613 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:34:55,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:34:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:34:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-18 17:34:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:34:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-18 17:34:55,631 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-18 17:34:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:55,631 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-18 17:34:55,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-18 17:34:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:55,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:55,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:55,632 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-18 17:34:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:55,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:55,770 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-18 17:34:55,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:55,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:55,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:55,771 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-18 17:34:55,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:55,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:55,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:55,776 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:34:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:55,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:55,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:55,777 INFO 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-18 17:34:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:55,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:55,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:55,797 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 18 treesize of output 21 [2019-01-18 17:34:55,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:34:55,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:34:55,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,819 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 25 treesize of output 51 [2019-01-18 17:34:55,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:55,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,907 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-18 17:34:55,907 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:55,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:55,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, 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-18 17:34:55,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:55,981 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-18 17:34:55,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:56,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:34:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:56,085 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-18 17:34:56,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:56,124 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:56,125 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-18 17:34:56,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:56,221 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-18 17:34:56,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:34:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:56,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:56,293 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-18 17:34:56,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:56,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:34:56,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:56,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:34:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:34:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:34:56,312 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-18 17:34:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:57,095 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-18 17:34:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:57,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:34:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:57,097 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:34:57,097 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:34:57,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 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-18 17:34:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:34:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-18 17:34:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:34:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-18 17:34:57,115 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-18 17:34:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:57,115 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-18 17:34:57,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:34:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-18 17:34:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:57,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:57,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:57,116 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-18 17:34:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:57,274 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-18 17:34:57,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:57,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:57,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:57,275 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-18 17:34:57,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:57,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:57,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:57,280 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:57,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:57,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:57,280 INFO 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-18 17:34:57,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:57,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:57,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:57,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:34:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:34:57,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:34:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:34:57,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:34:57,339 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,406 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-18 17:34:57,407 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:34:57,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,453 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-18 17:34:57,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,478 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-18 17:34:57,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:57,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:57,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:57,507 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-18 17:34:57,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:57,538 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-18 17:34:57,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:34:57,553 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-18 17:34:57,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:57,575 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-18 17:34:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:57,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:57,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:57,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:57,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:57,594 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-18 17:34:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:57,858 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-18 17:34:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:57,860 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:34:57,860 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:34:57,861 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-18 17:34:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:34:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-18 17:34:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:34:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-18 17:34:57,880 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-18 17:34:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-18 17:34:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-18 17:34:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:57,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:57,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:57,881 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-18 17:34:57,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:57,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:57,977 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-18 17:34:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:57,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:57,978 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:57,978 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-18 17:34:57,979 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:57,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:57,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:57,981 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:57,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:57,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:57,984 INFO 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-18 17:34:57,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:57,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:57,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:58,010 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 18 treesize of output 21 [2019-01-18 17:34:58,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,013 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 21 treesize of output 27 [2019-01-18 17:34:58,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,060 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 23 treesize of output 37 [2019-01-18 17:34:58,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:34:58,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:58,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,263 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-18 17:34:58,264 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,295 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-18 17:34:58,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,337 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-18 17:34:58,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:58,448 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-18 17:34:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:58,491 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-18 17:34:58,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:58,537 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-18 17:34:58,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:58,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:58,563 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-18 17:34:58,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:58,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:34:58,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:58,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:58,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:58,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:34:58,582 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-18 17:34:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:58,885 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-18 17:34:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:34:58,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:58,886 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:34:58,887 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:34:58,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:34:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-18 17:34:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:34:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-18 17:34:58,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-18 17:34:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:58,908 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-18 17:34:58,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-18 17:34:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:58,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:58,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:58,909 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-18 17:34:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:58,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:58,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:59,004 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-18 17:34:59,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:59,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:59,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:34:59,004 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-18 17:34:59,005 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:34:59,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:34:59,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:34:59,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:34:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:59,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:34:59,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:59,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:34:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:59,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:59,043 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 18 treesize of output 21 [2019-01-18 17:34:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,049 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 21 treesize of output 27 [2019-01-18 17:34:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,054 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 23 treesize of output 37 [2019-01-18 17:34:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:34:59,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,080 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:34:59,081 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,114 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,196 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-18 17:34:59,197 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:34:59,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:34:59,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,273 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-18 17:34:59,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:34:59,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:34:59,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, 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-18 17:34:59,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:59,353 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-18 17:34:59,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:34:59,376 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-18 17:34:59,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:59,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:59,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:34:59,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:59,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:34:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:34:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:34:59,417 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-18 17:34:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:59,751 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-18 17:34:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:34:59,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:34:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:59,752 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:34:59,752 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:34:59,752 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-18 17:34:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:34:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-18 17:34:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:34:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-18 17:34:59,773 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-18 17:34:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:59,773 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-18 17:34:59,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:34:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-18 17:34:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:34:59,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:59,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:34:59,774 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-18 17:34:59,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:59,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:00,065 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-18 17:35:00,287 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-18 17:35:00,307 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-18 17:35:00,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:00,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:00,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:00,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:00,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:00,308 INFO 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-18 17:35:00,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:00,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:00,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:35:00,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:00,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:00,328 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 18 treesize of output 21 [2019-01-18 17:35:00,330 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 21 treesize of output 23 [2019-01-18 17:35:00,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:00,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:00,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:00,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,438 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-18 17:35:00,439 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:00,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:35:00,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,497 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-18 17:35:00,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:00,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:35:00,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:00,555 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-18 17:35:00,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:00,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-18 17:35:00,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:00,616 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-18 17:35:00,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:00,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:35:00,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:00,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:35:00,636 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-18 17:35:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:01,564 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-18 17:35:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:01,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:35:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:01,566 INFO L225 Difference]: With dead ends: 110 [2019-01-18 17:35:01,566 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:35:01,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:35:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-18 17:35:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:35:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-18 17:35:01,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-18 17:35:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-18 17:35:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-18 17:35:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:35:01,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:01,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:35:01,598 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-18 17:35:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:01,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:01,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:01,744 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-18 17:35:01,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:01,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:01,744 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:35:01,745 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-18 17:35:01,746 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:01,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:01,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:01,749 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:35:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:01,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:01,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:01,749 INFO 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-18 17:35:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:01,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:01,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:01,765 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 18 treesize of output 21 [2019-01-18 17:35:01,768 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 21 treesize of output 23 [2019-01-18 17:35:01,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:01,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:01,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,808 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:01,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,828 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,879 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-18 17:35:01,880 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:01,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:01,917 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-18 17:35:01,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:01,951 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-18 17:35:01,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:01,967 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-18 17:35:01,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:01,979 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-18 17:35:01,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:35:01,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:01,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:35:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:35:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:35:01,999 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-18 17:35:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:02,293 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-18 17:35:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:35:02,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-18 17:35:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:02,295 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:35:02,295 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:35:02,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-18 17:35:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:35:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-18 17:35:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:35:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-18 17:35:02,314 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-18 17:35:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:02,314 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-18 17:35:02,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:35:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-18 17:35:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:35:02,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:02,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:35:02,315 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-18 17:35:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:02,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:02,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:02,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:02,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:35:02,456 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-18 17:35:02,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:02,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:02,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:02,460 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:02,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:02,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:02,461 INFO 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-18 17:35:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:02,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:02,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:02,478 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 18 treesize of output 21 [2019-01-18 17:35:02,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:02,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,489 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 23 treesize of output 37 [2019-01-18 17:35:02,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,498 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 25 treesize of output 51 [2019-01-18 17:35:02,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:02,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,589 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-18 17:35:02,590 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:02,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,623 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-18 17:35:02,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,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-18 17:35:02,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,702 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:02,703 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-18 17:35:02,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,748 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-18 17:35:02,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:02,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:02,785 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-18 17:35:02,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:02,844 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-18 17:35:02,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:02,867 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-18 17:35:02,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:02,903 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-18 17:35:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:02,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:02,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:02,923 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-18 17:35:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:03,503 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-18 17:35:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:03,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:35:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:03,505 INFO L225 Difference]: With dead ends: 133 [2019-01-18 17:35:03,506 INFO L226 Difference]: Without dead ends: 132 [2019-01-18 17:35:03,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-18 17:35:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-18 17:35:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:35:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-18 17:35:03,529 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-18 17:35:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:03,529 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-18 17:35:03,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-18 17:35:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:35:03,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:03,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:35:03,530 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-18 17:35:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:03,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:03,684 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-18 17:35:03,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:03,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:03,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:35:03,684 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-18 17:35:03,685 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:03,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:03,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:03,688 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:03,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:03,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:03,689 INFO 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-18 17:35:03,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:03,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:03,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:03,705 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 18 treesize of output 21 [2019-01-18 17:35:03,708 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 21 treesize of output 23 [2019-01-18 17:35:03,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:03,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:03,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:03,738 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,806 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-18 17:35:03,806 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:03,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:35:03,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:03,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:03,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:03,895 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-18 17:35:03,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:03,925 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-18 17:35:03,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:03,938 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-18 17:35:03,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:03,957 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-18 17:35:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:03,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:03,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:03,978 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-18 17:35:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:04,315 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-18 17:35:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:04,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:35:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:04,317 INFO L225 Difference]: With dead ends: 113 [2019-01-18 17:35:04,317 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 17:35:04,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:35:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 17:35:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-18 17:35:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-18 17:35:04,344 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-18 17:35:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:04,344 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-18 17:35:04,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-18 17:35:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:04,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:04,345 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 17:35:04,345 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-18 17:35:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:04,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:04,479 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-18 17:35:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:04,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:04,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:04,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:04,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:04,480 INFO 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-18 17:35:04,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:04,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:04,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:04,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:04,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:04,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,512 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 23 treesize of output 37 [2019-01-18 17:35:04,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,518 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 25 treesize of output 51 [2019-01-18 17:35:04,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,524 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:04,525 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,607 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-18 17:35:04,608 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,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, 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-18 17:35:04,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,727 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-18 17:35:04,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:04,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 78 [2019-01-18 17:35:04,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,811 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-18 17:35:04,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:04,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:04,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,903 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-18 17:35:04,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:04,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:04,941 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 110 [2019-01-18 17:35:04,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:04,993 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-18 17:35:04,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:05,019 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-18 17:35:05,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:05,071 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-18 17:35:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:35:05,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:05,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:35:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:35:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:05,091 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-18 17:35:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:05,932 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-18 17:35:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:05,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 17:35:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:05,934 INFO L225 Difference]: With dead ends: 136 [2019-01-18 17:35:05,934 INFO L226 Difference]: Without dead ends: 131 [2019-01-18 17:35:05,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:35:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-18 17:35:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-18 17:35:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-18 17:35:05,959 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-18 17:35:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:05,959 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-18 17:35:05,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:35:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-18 17:35:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:05,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:05,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:05,960 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-18 17:35:05,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:05,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:05,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:06,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-18 17:35:06,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:06,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:06,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:06,092 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-18 17:35:06,093 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:06,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:06,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:06,095 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:06,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:06,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:06,096 INFO 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-18 17:35:06,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:06,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:06,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:06,119 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 18 treesize of output 21 [2019-01-18 17:35:06,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,122 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 21 treesize of output 27 [2019-01-18 17:35:06,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,132 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 23 treesize of output 37 [2019-01-18 17:35:06,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,139 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 25 treesize of output 51 [2019-01-18 17:35:06,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,185 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:06,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,265 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-18 17:35:06,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:06,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,301 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-18 17:35:06,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,340 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-18 17:35:06,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:06,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,383 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-18 17:35:06,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,429 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-18 17:35:06,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:06,470 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:06,471 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-18 17:35:06,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:06,521 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-18 17:35:06,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:06,541 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-18 17:35:06,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:06,581 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-18 17:35:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:06,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:06,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:06,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:06,600 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-18 17:35:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:07,096 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-18 17:35:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:07,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:07,098 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:35:07,098 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:35:07,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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-18 17:35:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:35:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-18 17:35:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-18 17:35:07,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-18 17:35:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:07,119 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-18 17:35:07,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-18 17:35:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:07,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:07,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:07,119 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-18 17:35:07,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:07,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:07,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:07,267 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-18 17:35:07,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:07,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:07,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:07,268 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-18 17:35:07,270 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:07,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:07,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:07,273 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:07,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:07,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:07,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:07,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,308 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 23 treesize of output 37 [2019-01-18 17:35:07,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,329 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 25 treesize of output 51 [2019-01-18 17:35:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,336 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:07,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,421 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-18 17:35:07,421 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,460 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-18 17:35:07,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,500 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-18 17:35:07,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:07,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,544 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-18 17:35:07,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:07,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:07,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:07,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, 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-18 17:35:07,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,719 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-18 17:35:07,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:07,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:07,768 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-18 17:35:07,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:07,818 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-18 17:35:07,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:07,844 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-18 17:35:07,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:07,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:07,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:07,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:07,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:07,920 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-18 17:35:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:08,670 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-18 17:35:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:08,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:08,672 INFO L225 Difference]: With dead ends: 131 [2019-01-18 17:35:08,672 INFO L226 Difference]: Without dead ends: 130 [2019-01-18 17:35:08,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-18 17:35:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-18 17:35:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-18 17:35:08,697 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-18 17:35:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:08,697 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-18 17:35:08,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-18 17:35:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:08,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:08,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:08,698 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-18 17:35:08,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:08,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:08,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:08,984 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-18 17:35:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:09,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:09,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:09,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:09,006 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-18 17:35:09,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:09,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:09,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:09,012 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:09,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:09,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:09,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:09,013 INFO 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-18 17:35:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:09,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:09,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:09,030 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 18 treesize of output 21 [2019-01-18 17:35:09,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:09,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:35:09,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:35:09,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:35:09,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,125 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-18 17:35:09,126 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:35:09,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,156 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:35:09,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,171 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-18 17:35:09,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:35:09,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,192 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-18 17:35:09,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,210 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-18 17:35:09,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:35:09,224 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-18 17:35:09,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:09,244 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-18 17:35:09,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:09,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:09,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:09,262 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-18 17:35:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:09,498 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-18 17:35:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:35:09,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:09,500 INFO L225 Difference]: With dead ends: 93 [2019-01-18 17:35:09,500 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:35:09,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-18 17:35:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:35:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-18 17:35:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-18 17:35:09,523 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-18 17:35:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:09,523 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-18 17:35:09,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-18 17:35:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:09,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:09,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:09,524 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-18 17:35:09,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:09,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:09,732 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-18 17:35:09,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:09,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:09,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:09,733 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-18 17:35:09,733 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:09,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:09,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:09,736 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:09,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:09,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:09,736 INFO 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-18 17:35:09,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:09,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:09,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:09,754 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 18 treesize of output 21 [2019-01-18 17:35:09,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,756 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 21 treesize of output 27 [2019-01-18 17:35:09,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,761 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 23 treesize of output 37 [2019-01-18 17:35:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,766 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 25 treesize of output 51 [2019-01-18 17:35:09,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,773 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:09,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,858 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:09,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:09,896 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-18 17:35:09,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,938 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-18 17:35:09,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,226 INFO L303 Elim1Store]: Index analysis took 265 ms [2019-01-18 17:35:10,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, 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-18 17:35:10,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:10,282 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-18 17:35:10,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:10,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,352 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:10,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-18 17:35:10,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:10,417 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-18 17:35:10,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:10,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:10,501 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:10,501 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-18 17:35:10,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:10,565 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-18 17:35:10,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:35:10,606 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-18 17:35:10,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:10,701 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-18 17:35:10,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:10,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:10,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:10,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:10,721 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-18 17:35:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:11,655 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-18 17:35:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:11,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:11,657 INFO L225 Difference]: With dead ends: 117 [2019-01-18 17:35:11,657 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:35:11,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:35:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:35:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-18 17:35:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:35:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-18 17:35:11,688 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-18 17:35:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:11,688 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-18 17:35:11,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-18 17:35:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:11,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:11,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:11,689 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-18 17:35:11,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:11,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:11,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:11,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:12,001 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:35:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:12,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:12,058 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:12,058 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-18 17:35:12,059 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:12,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:12,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:12,063 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:12,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:12,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:12,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:12,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:12,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:12,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:12,082 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 18 treesize of output 21 [2019-01-18 17:35:12,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:12,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:12,118 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,184 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-18 17:35:12,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:12,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,227 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-18 17:35:12,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,252 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-18 17:35:12,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,282 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 59 [2019-01-18 17:35:12,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,312 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-18 17:35:12,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:12,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:12,343 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:12,344 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-18 17:35:12,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:12,377 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-18 17:35:12,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:12,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:12,435 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-18 17:35:12,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:12,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:12,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:12,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:12,453 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-18 17:35:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:12,903 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-18 17:35:12,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:12,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:12,905 INFO L225 Difference]: With dead ends: 99 [2019-01-18 17:35:12,905 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 17:35:12,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 17:35:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-18 17:35:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:35:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-18 17:35:12,937 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-18 17:35:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:12,938 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-18 17:35:12,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-18 17:35:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:12,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:12,939 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 17:35:12,939 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-18 17:35:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:12,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:13,218 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-18 17:35:13,290 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-18 17:35:13,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:13,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:13,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:13,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:13,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:13,291 INFO 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-18 17:35:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:13,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:13,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:13,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:13,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:13,313 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 18 treesize of output 21 [2019-01-18 17:35:13,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,315 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 21 treesize of output 27 [2019-01-18 17:35:13,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:35:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:35:13,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:13,339 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,421 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-18 17:35:13,421 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:13,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,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, 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-18 17:35:13,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,500 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-18 17:35:13,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:13,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,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, 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-18 17:35:13,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,586 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-18 17:35:13,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:13,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,630 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-18 17:35:13,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,682 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-18 17:35:13,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:13,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:13,732 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 110 [2019-01-18 17:35:13,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:13,786 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-18 17:35:13,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:13,815 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-18 17:35:13,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:13,861 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-18 17:35:13,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:35:13,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:13,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:35:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:35:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:13,881 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-18 17:35:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:14,600 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-18 17:35:14,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:14,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 17:35:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:14,602 INFO L225 Difference]: With dead ends: 132 [2019-01-18 17:35:14,602 INFO L226 Difference]: Without dead ends: 130 [2019-01-18 17:35:14,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:35:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-18 17:35:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-18 17:35:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:35:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-18 17:35:14,634 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-18 17:35:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:14,635 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-18 17:35:14,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:35:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-18 17:35:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:14,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:14,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:14,636 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-18 17:35:14,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:14,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:14,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:14,798 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-18 17:35:14,824 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-18 17:35:14,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:14,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:14,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:14,825 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-18 17:35:14,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:14,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:14,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:14,829 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:14,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:14,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:14,830 INFO 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-18 17:35:14,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:14,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:14,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:14,892 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 18 treesize of output 21 [2019-01-18 17:35:14,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,909 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 21 treesize of output 27 [2019-01-18 17:35:14,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:35:14,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,919 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 25 treesize of output 51 [2019-01-18 17:35:14,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:14,929 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:14,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:14,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:14,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:14,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:14,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,009 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-18 17:35:15,009 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:15,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:35:15,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,082 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-18 17:35:15,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:15,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,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, 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-18 17:35:15,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,168 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-18 17:35:15,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:15,191 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-18 17:35:15,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:15,211 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-18 17:35:15,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:15,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:15,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:15,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:15,231 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-18 17:35:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:15,651 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-18 17:35:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:35:15,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:15,652 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:35:15,653 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:35:15,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:35:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-18 17:35:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:35:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-18 17:35:15,685 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-18 17:35:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:15,685 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-18 17:35:15,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-18 17:35:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:15,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:15,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:15,686 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-18 17:35:15,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:15,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:15,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:15,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:15,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:15,806 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-18 17:35:15,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:15,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:15,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:15,807 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-18 17:35:15,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:15,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:15,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:15,810 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:15,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:15,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:15,812 INFO 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-18 17:35:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:15,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:15,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:15,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 18 treesize of output 21 [2019-01-18 17:35:15,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,833 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 21 treesize of output 27 [2019-01-18 17:35:15,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,842 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 23 treesize of output 37 [2019-01-18 17:35:15,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,854 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 25 treesize of output 51 [2019-01-18 17:35:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,876 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:15,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:15,962 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-18 17:35:15,962 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:15,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:15,996 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-18 17:35:15,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:16,034 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-18 17:35:16,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:16,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,071 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-18 17:35:16,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:16,118 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-18 17:35:16,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:16,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,153 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:16,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:16,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, 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-18 17:35:16,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:16,206 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-18 17:35:16,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:16,226 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-18 17:35:16,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:16,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:16,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:35:16,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:16,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:16,268 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-18 17:35:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:16,724 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-18 17:35:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:16,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:16,726 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:35:16,726 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:35:16,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:35:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-18 17:35:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:35:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-18 17:35:16,759 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-18 17:35:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:16,759 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-18 17:35:16,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-18 17:35:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:16,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:16,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:16,760 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-18 17:35:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:16,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:16,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:16,904 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:35:16,963 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-18 17:35:16,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:16,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:16,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:16,964 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-18 17:35:16,965 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:16,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:16,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:16,968 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:16,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:16,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:16,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:16,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:17,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:17,022 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 18 treesize of output 21 [2019-01-18 17:35:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,026 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 21 treesize of output 27 [2019-01-18 17:35:17,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,036 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 23 treesize of output 37 [2019-01-18 17:35:17,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,096 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 25 treesize of output 51 [2019-01-18 17:35:17,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:17,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,187 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-18 17:35:17,188 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:17,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:17,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,268 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-18 17:35:17,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:17,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,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, 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-18 17:35:17,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,350 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-18 17:35:17,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:17,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:17,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:17,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, 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-18 17:35:17,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:17,443 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-18 17:35:17,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:17,465 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-18 17:35:17,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:17,502 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-18 17:35:17,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:17,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:17,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:17,521 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-18 17:35:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:18,059 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-18 17:35:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:18,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:18,061 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:35:18,062 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:35:18,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:35:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-18 17:35:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:35:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-18 17:35:18,091 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-18 17:35:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:18,091 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-18 17:35:18,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-18 17:35:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:18,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:18,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:18,092 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-18 17:35:18,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:18,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:18,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:18,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-18 17:35:18,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:18,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:18,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:18,170 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-18 17:35:18,171 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:18,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:18,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:18,174 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:18,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:18,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:18,174 INFO 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-18 17:35:18,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:18,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:18,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:18,195 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 18 treesize of output 21 [2019-01-18 17:35:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:18,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:18,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:18,232 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,299 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-18 17:35:18,299 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:18,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,341 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-18 17:35:18,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,483 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-18 17:35:18,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:18,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:18,509 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:18,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, 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-18 17:35:18,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:18,539 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-18 17:35:18,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:35:18,558 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-18 17:35:18,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:18,577 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-18 17:35:18,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:18,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:18,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:18,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:18,597 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-18 17:35:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:18,877 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-18 17:35:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:35:18,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:18,878 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:35:18,879 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:35:18,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-18 17:35:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:35:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-18 17:35:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:35:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-18 17:35:18,922 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-18 17:35:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:18,922 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-18 17:35:18,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-18 17:35:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:18,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:18,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:18,923 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-18 17:35:18,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:18,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:18,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:19,423 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:35:19,569 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-18 17:35:19,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:19,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:19,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:19,569 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-18 17:35:19,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:19,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:19,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:19,573 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:19,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:19,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:19,574 INFO 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-18 17:35:19,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:19,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:19,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:19,593 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 18 treesize of output 21 [2019-01-18 17:35:19,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:19,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:19,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:19,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,772 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-18 17:35:19,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:19,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,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, 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-18 17:35:19,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,838 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-18 17:35:19,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:19,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,870 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:19,871 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-18 17:35:19,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,897 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-18 17:35:19,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:35:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:19,950 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 69 [2019-01-18 17:35:19,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:19,978 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-18 17:35:19,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:35:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:19,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:20,046 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-18 17:35:20,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:20,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:20,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:20,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:20,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:20,066 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-18 17:35:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:20,460 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-18 17:35:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:20,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:20,462 INFO L225 Difference]: With dead ends: 116 [2019-01-18 17:35:20,462 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:35:20,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:35:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-18 17:35:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:35:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-18 17:35:20,498 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-18 17:35:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:20,498 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-18 17:35:20,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-18 17:35:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:20,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:20,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:20,499 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-18 17:35:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:20,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:20,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:20,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:20,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:20,774 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-18 17:35:20,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:20,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:20,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:20,775 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-18 17:35:20,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:20,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:20,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:20,778 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:20,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:20,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:20,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 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-18 17:35:20,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:20,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:20,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:20,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,818 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 21 treesize of output 27 [2019-01-18 17:35:20,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,824 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 23 treesize of output 37 [2019-01-18 17:35:20,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:35:20,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,847 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:20,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:20,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:20,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:20,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:20,938 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-18 17:35:20,939 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:20,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:20,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,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, 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-18 17:35:21,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:21,050 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-18 17:35:21,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,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 38 treesize of output 88 [2019-01-18 17:35:21,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:21,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-18 17:35:21,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:21,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, 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-18 17:35:21,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:21,258 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-18 17:35:21,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:21,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,329 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:21,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:21,330 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-18 17:35:21,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:21,395 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-18 17:35:21,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:21,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:21,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:21,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:21,488 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-18 17:35:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:22,416 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-18 17:35:22,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:22,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:22,419 INFO L225 Difference]: With dead ends: 140 [2019-01-18 17:35:22,419 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 17:35:22,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 17:35:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-18 17:35:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:35:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-18 17:35:22,466 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-18 17:35:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:22,466 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-18 17:35:22,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-18 17:35:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:22,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:22,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:22,467 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-18 17:35:22,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:22,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:22,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:22,523 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-18 17:35:22,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:22,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:22,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:22,524 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-18 17:35:22,524 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:22,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:22,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:22,527 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:22,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:22,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:22,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:22,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:22,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:22,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 18 treesize of output 21 [2019-01-18 17:35:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:22,559 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 23 treesize of output 25 [2019-01-18 17:35:22,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:35:22,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:35:22,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,644 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-18 17:35:22,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-18 17:35:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,673 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:35:22,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,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-18 17:35:22,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:35:22,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:22,709 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 50 [2019-01-18 17:35:22,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:22,729 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-18 17:35:22,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:35:22,742 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-18 17:35:22,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:22,754 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-18 17:35:22,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:22,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:35:22,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:22,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:35:22,772 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-18 17:35:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:23,040 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-18 17:35:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:23,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:23,042 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:35:23,042 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:35:23,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:35:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-18 17:35:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:35:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-18 17:35:23,076 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-18 17:35:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:23,077 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-18 17:35:23,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-18 17:35:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:23,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:23,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:23,077 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-18 17:35:23,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:23,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:23,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:23,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:23,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:23,247 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-18 17:35:23,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:23,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:23,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:23,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:23,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:23,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 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-18 17:35:23,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:23,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:23,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:23,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:23,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:23,268 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 18 treesize of output 21 [2019-01-18 17:35:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,275 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 21 treesize of output 27 [2019-01-18 17:35:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,284 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 23 treesize of output 37 [2019-01-18 17:35:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:35:23,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,307 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:23,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,387 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-18 17:35:23,387 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:23,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,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, 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-18 17:35:23,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,474 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-18 17:35:23,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,515 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:23,515 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-18 17:35:23,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,561 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-18 17:35:23,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:23,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,653 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-18 17:35:23,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:23,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:23,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:23,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, 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-18 17:35:23,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:23,737 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-18 17:35:23,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:23,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:23,939 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-18 17:35:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:23,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:23,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:23,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:23,958 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-18 17:35:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:24,865 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-18 17:35:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:24,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:24,867 INFO L225 Difference]: With dead ends: 137 [2019-01-18 17:35:24,867 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:35:24,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:35:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-18 17:35:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:35:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-18 17:35:24,904 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-18 17:35:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:24,904 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-18 17:35:24,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-18 17:35:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:24,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:24,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:24,906 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-18 17:35:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:24,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:24,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:25,055 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-18 17:35:25,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:25,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:25,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:25,056 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-18 17:35:25,057 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:25,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:25,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:25,060 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:25,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:25,061 INFO 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-18 17:35:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:25,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:25,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:25,081 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 18 treesize of output 21 [2019-01-18 17:35:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,083 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 21 treesize of output 27 [2019-01-18 17:35:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:35:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,093 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 25 treesize of output 51 [2019-01-18 17:35:25,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,100 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:25,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,185 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-18 17:35:25,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:35:25,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,266 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-18 17:35:25,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:25,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:25,301 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-18 17:35:25,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,349 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-18 17:35:25,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:25,452 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-18 17:35:25,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:25,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:25,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:25,520 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-18 17:35:25,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:25,545 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-18 17:35:25,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:25,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:35:25,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:25,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:25,564 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-18 17:35:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:26,129 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-18 17:35:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:26,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:26,131 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:35:26,131 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 17:35:26,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 17:35:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-18 17:35:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:35:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-18 17:35:26,173 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-18 17:35:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:26,173 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-18 17:35:26,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-18 17:35:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:26,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:26,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:26,174 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-18 17:35:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:26,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:26,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:26,323 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-18 17:35:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:26,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:26,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:26,324 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-18 17:35:26,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:26,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:26,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:26,328 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:26,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:26,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:26,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 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-18 17:35:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:26,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:26,354 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 18 treesize of output 21 [2019-01-18 17:35:26,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:26,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,370 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 23 treesize of output 37 [2019-01-18 17:35:26,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,379 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 25 treesize of output 51 [2019-01-18 17:35:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:26,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,477 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-18 17:35:26,477 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:26,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,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 72 [2019-01-18 17:35:26,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,553 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-18 17:35:26,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,590 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:26,591 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-18 17:35:26,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,637 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-18 17:35:26,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:26,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:26,673 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:26,674 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-18 17:35:26,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:26,717 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-18 17:35:26,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:26,739 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-18 17:35:26,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:26,776 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-18 17:35:26,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:26,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:35:26,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:26,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:35:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:35:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:26,795 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-18 17:35:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:27,331 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-18 17:35:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:27,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 17:35:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:27,333 INFO L225 Difference]: With dead ends: 119 [2019-01-18 17:35:27,333 INFO L226 Difference]: Without dead ends: 118 [2019-01-18 17:35:27,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-18 17:35:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-18 17:35:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:35:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-18 17:35:27,381 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-18 17:35:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:27,382 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-18 17:35:27,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:35:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-18 17:35:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:27,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:27,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:27,383 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:27,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-18 17:35:27,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:27,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:27,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:27,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:27,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:27,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:27,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:27,538 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-18 17:35:27,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:27,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:27,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:27,541 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:27,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:27,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:27,541 INFO 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-18 17:35:27,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:27,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:27,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:27,564 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 18 treesize of output 21 [2019-01-18 17:35:27,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,567 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 21 treesize of output 27 [2019-01-18 17:35:27,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,575 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 23 treesize of output 37 [2019-01-18 17:35:27,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,582 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 25 treesize of output 51 [2019-01-18 17:35:27,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:27,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,669 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-18 17:35:27,670 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:27,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,703 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-18 17:35:27,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,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-18 17:35:27,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:27,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,781 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-18 17:35:27,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,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-18 17:35:27,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:27,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,868 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:27,869 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-18 17:35:27,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:27,913 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-18 17:35:27,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:27,965 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:27,966 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-18 17:35:27,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:28,013 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-18 17:35:28,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:28,032 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-18 17:35:28,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:35:28,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:28,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:28,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:28,092 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-18 17:35:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:29,079 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-18 17:35:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:29,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:29,082 INFO L225 Difference]: With dead ends: 149 [2019-01-18 17:35:29,082 INFO L226 Difference]: Without dead ends: 148 [2019-01-18 17:35:29,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:35:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-18 17:35:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-18 17:35:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:35:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-18 17:35:29,133 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-18 17:35:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:29,133 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-18 17:35:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-18 17:35:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:29,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:29,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:29,134 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-18 17:35:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:29,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:29,245 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-18 17:35:29,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:29,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:29,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:29,245 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-18 17:35:29,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:29,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:29,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:29,249 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:29,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:29,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:29,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:35:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:29,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:29,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:29,269 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 18 treesize of output 21 [2019-01-18 17:35:29,277 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 21 treesize of output 23 [2019-01-18 17:35:29,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:29,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:29,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,383 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-18 17:35:29,383 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:29,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,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, 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-18 17:35:29,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,448 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-18 17:35:29,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:29,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,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, 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-18 17:35:29,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,506 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-18 17:35:29,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:29,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:29,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:29,536 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-18 17:35:29,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:29,568 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-18 17:35:29,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:29,586 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-18 17:35:29,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:29,621 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-18 17:35:29,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:29,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:29,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:29,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:29,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:29,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:29,642 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-18 17:35:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:30,151 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-18 17:35:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:30,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:30,153 INFO L225 Difference]: With dead ends: 139 [2019-01-18 17:35:30,153 INFO L226 Difference]: Without dead ends: 138 [2019-01-18 17:35:30,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-18 17:35:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-18 17:35:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:35:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-18 17:35:30,207 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-18 17:35:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:30,207 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-18 17:35:30,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-18 17:35:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:30,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:30,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:30,208 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-18 17:35:30,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:30,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:30,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:30,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:30,371 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:35:30,449 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-18 17:35:30,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:30,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:30,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:30,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:30,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:30,450 INFO 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-18 17:35:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:30,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:30,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:30,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:30,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:30,474 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 18 treesize of output 21 [2019-01-18 17:35:30,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,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 21 treesize of output 27 [2019-01-18 17:35:30,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,486 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 23 treesize of output 37 [2019-01-18 17:35:30,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,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 25 treesize of output 51 [2019-01-18 17:35:30,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:30,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,585 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-18 17:35:30,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,623 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-18 17:35:30,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,664 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-18 17:35:30,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:30,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:30,707 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-18 17:35:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,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-18 17:35:30,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:30,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:35:30,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,871 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-18 17:35:30,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:30,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:30,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 86 [2019-01-18 17:35:30,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:30,996 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-18 17:35:30,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:31,020 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-18 17:35:31,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:31,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:31,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:31,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:31,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:31,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:31,099 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-18 17:35:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:31,886 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-18 17:35:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:31,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:31,889 INFO L225 Difference]: With dead ends: 164 [2019-01-18 17:35:31,889 INFO L226 Difference]: Without dead ends: 163 [2019-01-18 17:35:31,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-18 17:35:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-18 17:35:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:35:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-18 17:35:31,943 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-18 17:35:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:31,943 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-18 17:35:31,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-18 17:35:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:31,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:31,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:31,944 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-18 17:35:31,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:31,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:31,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:32,050 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-18 17:35:32,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:32,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:32,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:32,050 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-18 17:35:32,052 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:32,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:32,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:32,054 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:32,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:32,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:32,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:32,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:32,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:32,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:32,080 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 18 treesize of output 21 [2019-01-18 17:35:32,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,092 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 23 treesize of output 37 [2019-01-18 17:35:32,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,106 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 25 treesize of output 51 [2019-01-18 17:35:32,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:32,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,202 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-18 17:35:32,202 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,236 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-18 17:35:32,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:32,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:32,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:32,318 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-18 17:35:32,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:32,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:32,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:32,389 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-18 17:35:32,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:32,411 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-18 17:35:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:32,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:32,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:32,432 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-18 17:35:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:32,802 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-18 17:35:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:35:32,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:32,805 INFO L225 Difference]: With dead ends: 122 [2019-01-18 17:35:32,805 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 17:35:32,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 17:35:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-18 17:35:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 17:35:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-18 17:35:32,874 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-18 17:35:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-18 17:35:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-18 17:35:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:32,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:32,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:32,875 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-18 17:35:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:32,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:33,039 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-18 17:35:33,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:33,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:33,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:33,040 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-18 17:35:33,041 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:33,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:33,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:33,044 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:33,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:33,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:33,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:33,045 INFO 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-18 17:35:33,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:33,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:33,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:33,069 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 18 treesize of output 21 [2019-01-18 17:35:33,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,071 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 21 treesize of output 27 [2019-01-18 17:35:33,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,078 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 23 treesize of output 37 [2019-01-18 17:35:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,083 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 25 treesize of output 51 [2019-01-18 17:35:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:33,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,175 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-18 17:35:33,176 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:33,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,209 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-18 17:35:33,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,253 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-18 17:35:33,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:33,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:33,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:33,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,336 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-18 17:35:33,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:33,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:33,378 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-18 17:35:33,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:33,427 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-18 17:35:33,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:33,447 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-18 17:35:33,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:33,475 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-18 17:35:33,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:35:33,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:33,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:33,495 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-18 17:35:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:34,053 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-18 17:35:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:34,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:34,055 INFO L225 Difference]: With dead ends: 154 [2019-01-18 17:35:34,055 INFO L226 Difference]: Without dead ends: 153 [2019-01-18 17:35:34,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-18 17:35:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-18 17:35:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:35:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-18 17:35:34,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-18 17:35:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:34,122 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-18 17:35:34,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-18 17:35:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:34,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:34,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:34,123 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-18 17:35:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:34,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:34,636 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:35:34,807 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-18 17:35:34,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:34,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:34,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:34,808 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-18 17:35:34,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:34,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:34,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:34,811 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:34,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:34,812 INFO 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-18 17:35:34,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:34,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:34,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:34,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 18 treesize of output 21 [2019-01-18 17:35:34,834 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 21 treesize of output 23 [2019-01-18 17:35:34,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:34,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:34,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,926 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-18 17:35:34,926 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:34,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:34,964 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-18 17:35:34,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:34,991 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-18 17:35:34,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:35,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:35:35,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,047 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-18 17:35:35,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:35,065 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-18 17:35:35,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:35,088 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-18 17:35:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:35,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:35,108 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-18 17:35:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:35,418 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-18 17:35:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:35:35,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:35,421 INFO L225 Difference]: With dead ends: 130 [2019-01-18 17:35:35,421 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 17:35:35,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 17:35:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-18 17:35:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:35:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-18 17:35:35,487 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-18 17:35:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:35,487 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-18 17:35:35,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-18 17:35:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:35,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:35,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:35,488 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-18 17:35:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:35,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:35,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:35,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:35,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:35,640 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-18 17:35:35,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:35,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:35,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:35,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:35,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:35,641 INFO 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-18 17:35:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:35,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:35,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:35,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:35,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:35,660 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 18 treesize of output 21 [2019-01-18 17:35:35,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,664 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 21 treesize of output 27 [2019-01-18 17:35:35,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,670 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 23 treesize of output 37 [2019-01-18 17:35:35,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,688 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 25 treesize of output 51 [2019-01-18 17:35:35,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:35,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,779 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-18 17:35:35,780 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,817 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-18 17:35:35,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:35,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:35,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:35,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:35,936 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-18 17:35:35,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,010 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-18 17:35:36,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:36,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:36,071 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-18 17:35:36,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,125 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-18 17:35:36,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:36,146 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-18 17:35:36,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:36,175 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-18 17:35:36,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:36,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:35:36,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:36,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:35:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:35:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:36,195 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-18 17:35:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:36,701 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-18 17:35:36,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:36,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 17:35:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:36,703 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:35:36,703 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:35:36,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:35:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:35:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-18 17:35:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 17:35:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-18 17:35:36,772 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-18 17:35:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:36,773 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-18 17:35:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:35:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-18 17:35:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:36,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:36,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:36,774 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-18 17:35:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:36,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:36,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:36,877 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-18 17:35:36,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:36,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:36,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:36,878 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-18 17:35:36,881 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:36,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:36,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:36,883 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:35:36,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:36,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:36,884 INFO 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-18 17:35:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:36,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:36,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:36,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:36,903 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 21 treesize of output 23 [2019-01-18 17:35:36,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:36,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:36,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:36,930 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:36,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:36,997 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-18 17:35:36,998 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:37,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,030 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-18 17:35:37,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,057 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-18 17:35:37,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:37,074 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-18 17:35:37,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:37,083 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-18 17:35:37,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:35:37,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:35:37,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:35:37,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:35:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:35:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:35:37,102 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-18 17:35:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:37,195 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-18 17:35:37,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:35:37,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-18 17:35:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:37,197 INFO L225 Difference]: With dead ends: 121 [2019-01-18 17:35:37,197 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 17:35:37,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:35:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 17:35:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-18 17:35:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 17:35:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-18 17:35:37,263 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-18 17:35:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:37,264 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-18 17:35:37,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:35:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-18 17:35:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:37,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:37,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:37,264 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-18 17:35:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:37,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:37,409 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-18 17:35:37,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:37,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:37,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:37,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:37,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:37,410 INFO 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-18 17:35:37,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:37,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:37,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:37,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:37,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:37,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 18 treesize of output 21 [2019-01-18 17:35:37,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,433 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 21 treesize of output 27 [2019-01-18 17:35:37,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,439 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 23 treesize of output 37 [2019-01-18 17:35:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,451 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 25 treesize of output 51 [2019-01-18 17:35:37,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:37,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,542 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-18 17:35:37,543 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:37,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,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-18 17:35:37,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,623 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-18 17:35:37,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:37,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,663 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-18 17:35:37,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,707 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-18 17:35:37,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:37,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:37,748 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-18 17:35:37,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:37,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-18 17:35:37,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:37,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:37,983 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:37,983 INFO L303 Elim1Store]: Index analysis took 160 ms [2019-01-18 17:35:37,984 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 99 [2019-01-18 17:35:37,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:38,106 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-18 17:35:38,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:38,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:38,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:38,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:38,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:38,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:38,205 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-18 17:35:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:39,141 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-18 17:35:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:39,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:39,145 INFO L225 Difference]: With dead ends: 186 [2019-01-18 17:35:39,145 INFO L226 Difference]: Without dead ends: 184 [2019-01-18 17:35:39,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-18 17:35:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-18 17:35:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-18 17:35:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-18 17:35:39,221 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-18 17:35:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:39,222 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-18 17:35:39,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-18 17:35:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:39,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:39,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:39,223 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-18 17:35:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:39,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:39,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:39,385 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-18 17:35:39,412 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-18 17:35:39,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:39,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:39,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:35:39,413 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-18 17:35:39,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:39,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:39,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:39,418 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:39,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:39,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:39,419 INFO 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-18 17:35:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:39,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:39,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:39,435 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 18 treesize of output 21 [2019-01-18 17:35:39,441 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 21 treesize of output 23 [2019-01-18 17:35:39,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:39,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:39,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:39,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,536 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-18 17:35:39,537 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:39,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,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, 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-18 17:35:39,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:39,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:39,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:39,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, 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-18 17:35:39,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:39,657 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-18 17:35:39,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:39,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:39,684 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-18 17:35:39,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:39,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:35:39,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:39,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:35:39,704 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-18 17:35:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:40,048 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-18 17:35:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:40,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:40,050 INFO L225 Difference]: With dead ends: 161 [2019-01-18 17:35:40,050 INFO L226 Difference]: Without dead ends: 160 [2019-01-18 17:35:40,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:35:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-18 17:35:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-18 17:35:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-18 17:35:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-18 17:35:40,163 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-18 17:35:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:40,163 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-18 17:35:40,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-18 17:35:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:40,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:40,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:40,164 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-18 17:35:40,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:40,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:40,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:40,476 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-18 17:35:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:40,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:40,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:40,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:40,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:40,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:40,520 INFO 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-18 17:35:40,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:40,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:40,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:35:40,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:40,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:40,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:35:40,553 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 23 treesize of output 25 [2019-01-18 17:35:40,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:35:40,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:35:40,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,634 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-18 17:35:40,634 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-18 17:35:40,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:35:40,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,681 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-18 17:35:40,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:35:40,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:40,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:35:40,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,723 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-18 17:35:40,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:35:40,737 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-18 17:35:40,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:40,756 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-18 17:35:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:40,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:40,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:40,776 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-18 17:35:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:41,153 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-18 17:35:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:41,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:35:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:41,155 INFO L225 Difference]: With dead ends: 172 [2019-01-18 17:35:41,155 INFO L226 Difference]: Without dead ends: 170 [2019-01-18 17:35:41,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:35:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-18 17:35:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-18 17:35:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:35:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-18 17:35:41,238 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-18 17:35:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:41,238 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-18 17:35:41,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-18 17:35:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:41,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:41,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:41,239 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-18 17:35:41,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:41,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:41,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:41,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:41,394 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:35:41,494 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-18 17:35:41,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:41,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:41,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:41,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:41,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:41,495 INFO 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-18 17:35:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:41,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:41,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:41,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:41,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:41,513 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 18 treesize of output 21 [2019-01-18 17:35:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:41,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:35:41,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,527 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 25 treesize of output 51 [2019-01-18 17:35:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,535 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:41,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,616 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-18 17:35:41,616 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:41,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,655 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-18 17:35:41,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,699 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-18 17:35:41,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,737 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:41,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:35:41,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,784 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-18 17:35:41,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,823 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-18 17:35:41,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,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-18 17:35:41,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:41,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,907 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:41,909 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-18 17:35:41,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:41,958 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-18 17:35:41,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:41,989 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-18 17:35:41,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:42,048 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-18 17:35:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:42,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:42,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:42,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:42,068 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-18 17:35:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:42,865 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-18 17:35:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:42,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:35:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:42,868 INFO L225 Difference]: With dead ends: 209 [2019-01-18 17:35:42,868 INFO L226 Difference]: Without dead ends: 207 [2019-01-18 17:35:42,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-18 17:35:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-18 17:35:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-18 17:35:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-18 17:35:42,947 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-18 17:35:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:42,948 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-18 17:35:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-18 17:35:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:35:42,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:42,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:35:42,949 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-18 17:35:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:42,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:42,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:43,087 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-18 17:35:43,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:43,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:43,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:43,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:43,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:43,088 INFO 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-18 17:35:43,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:43,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:43,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:43,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:43,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:43,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:35:43,117 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 21 treesize of output 23 [2019-01-18 17:35:43,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:43,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:43,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,140 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:43,141 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,210 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-18 17:35:43,211 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:43,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,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, 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-18 17:35:43,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,275 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-18 17:35:43,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:43,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,300 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-18 17:35:43,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,330 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-18 17:35:43,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:43,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:43,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:43,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, 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 83 [2019-01-18 17:35:43,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:43,442 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-18 17:35:43,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:43,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:43,518 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-18 17:35:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:35:43,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:43,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:35:43,538 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-18 17:35:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:44,037 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-18 17:35:44,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:44,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:35:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:44,040 INFO L225 Difference]: With dead ends: 180 [2019-01-18 17:35:44,040 INFO L226 Difference]: Without dead ends: 173 [2019-01-18 17:35:44,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:35:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-18 17:35:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-18 17:35:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 17:35:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-18 17:35:44,141 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-18 17:35:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-18 17:35:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-18 17:35:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:44,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:44,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:44,142 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-18 17:35:44,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:44,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:44,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:44,684 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:35:44,761 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-18 17:35:44,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:44,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:44,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:44,762 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-18 17:35:44,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:44,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:44,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:44,765 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:44,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:44,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:44,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:44,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:44,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:44,781 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 18 treesize of output 21 [2019-01-18 17:35:44,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,788 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 21 treesize of output 27 [2019-01-18 17:35:44,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,794 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 23 treesize of output 37 [2019-01-18 17:35:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,803 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 25 treesize of output 51 [2019-01-18 17:35:44,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,815 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:44,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,897 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-18 17:35:44,897 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:44,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,932 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-18 17:35:44,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:44,971 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-18 17:35:44,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:44,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,004 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-18 17:35:45,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:45,049 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-18 17:35:45,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:45,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,087 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:45,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, 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-18 17:35:45,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:45,138 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-18 17:35:45,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:45,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:45,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:45,176 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-18 17:35:45,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:45,223 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-18 17:35:45,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:45,245 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-18 17:35:45,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:45,443 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-18 17:35:45,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:45,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:35:45,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:45,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:45,463 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-18 17:35:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:46,353 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-18 17:35:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:35:46,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:35:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:46,355 INFO L225 Difference]: With dead ends: 189 [2019-01-18 17:35:46,355 INFO L226 Difference]: Without dead ends: 188 [2019-01-18 17:35:46,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-18 17:35:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-18 17:35:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-18 17:35:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-18 17:35:46,453 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-18 17:35:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:46,453 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-18 17:35:46,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-18 17:35:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:46,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:46,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:46,454 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-18 17:35:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:46,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:46,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:46,662 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-18 17:35:46,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:46,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:46,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:46,663 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-18 17:35:46,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:46,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:46,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:46,667 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:46,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:46,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:46,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:35:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:46,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:46,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:46,684 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 18 treesize of output 21 [2019-01-18 17:35:46,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,686 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 21 treesize of output 27 [2019-01-18 17:35:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,690 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 23 treesize of output 37 [2019-01-18 17:35:46,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:35:46,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,710 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:46,710 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,792 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,828 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-18 17:35:46,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,869 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-18 17:35:46,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,908 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-18 17:35:46,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:46,952 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-18 17:35:46,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:46,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:46,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:46,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, 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-18 17:35:46,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:47,038 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-18 17:35:47,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:47,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:47,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:47,078 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-18 17:35:47,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:47,125 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-18 17:35:47,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:47,150 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-18 17:35:47,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:47,205 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-18 17:35:47,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:35:47,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:35:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:35:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:47,224 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-18 17:35:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:48,008 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-18 17:35:48,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:35:48,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:35:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:48,010 INFO L225 Difference]: With dead ends: 169 [2019-01-18 17:35:48,011 INFO L226 Difference]: Without dead ends: 168 [2019-01-18 17:35:48,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-18 17:35:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-18 17:35:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 17:35:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-18 17:35:48,106 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-18 17:35:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:48,106 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-18 17:35:48,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:35:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-18 17:35:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:48,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:48,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:48,106 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-18 17:35:48,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:48,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:48,194 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-18 17:35:48,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:48,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:48,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:48,195 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-18 17:35:48,195 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:48,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:48,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:48,198 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:35:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:48,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:48,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:48,199 INFO 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-18 17:35:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:48,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:48,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:48,221 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 18 treesize of output 21 [2019-01-18 17:35:48,229 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 21 treesize of output 23 [2019-01-18 17:35:48,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:35:48,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:35:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-18 17:35:48,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,341 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-18 17:35:48,341 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-18 17:35:48,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 17:35:48,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:35:48,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:48,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:48,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:48,399 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-18 17:35:48,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-18 17:35:48,413 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-18 17:35:48,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:48,432 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-18 17:35:48,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:48,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:35:48,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:48,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:35:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:35:48,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:35:48,451 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-18 17:35:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:48,740 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-18 17:35:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:48,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:35:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:48,742 INFO L225 Difference]: With dead ends: 159 [2019-01-18 17:35:48,743 INFO L226 Difference]: Without dead ends: 158 [2019-01-18 17:35:48,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:35:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-18 17:35:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-18 17:35:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-18 17:35:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-18 17:35:48,835 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-18 17:35:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:48,836 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-18 17:35:48,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:35:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-18 17:35:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:48,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:48,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:48,836 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-18 17:35:48,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:48,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:49,044 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-18 17:35:49,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:49,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:49,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:49,045 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-18 17:35:49,046 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:49,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:49,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:49,048 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:35:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:49,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:49,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:49,049 INFO 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-18 17:35:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:49,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:49,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:49,068 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 18 treesize of output 21 [2019-01-18 17:35:49,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,073 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 21 treesize of output 27 [2019-01-18 17:35:49,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,118 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 23 treesize of output 37 [2019-01-18 17:35:49,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,123 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 25 treesize of output 51 [2019-01-18 17:35:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:49,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,211 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:49,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,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, 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-18 17:35:49,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,288 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-18 17:35:49,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:49,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,325 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-18 17:35:49,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,367 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-18 17:35:49,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:49,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:49,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,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, 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-18 17:35:49,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,465 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-18 17:35:49,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:49,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:49,507 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-18 17:35:49,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,557 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-18 17:35:49,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:35:49,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:49,618 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:49,619 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 96 [2019-01-18 17:35:49,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:49,665 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-18 17:35:49,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:35:49,686 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-18 17:35:49,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:49,752 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-18 17:35:49,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:49,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:35:49,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:49,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:35:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:35:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:35:49,771 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-18 17:35:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:51,045 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-18 17:35:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:35:51,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-18 17:35:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:51,048 INFO L225 Difference]: With dead ends: 199 [2019-01-18 17:35:51,048 INFO L226 Difference]: Without dead ends: 198 [2019-01-18 17:35:51,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:35:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-18 17:35:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-18 17:35:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 17:35:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-18 17:35:51,140 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-18 17:35:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:51,140 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-18 17:35:51,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:35:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-18 17:35:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:51,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:51,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:51,141 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-18 17:35:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:51,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:51,325 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-18 17:35:51,445 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-18 17:35:51,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:51,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:51,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:51,446 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-18 17:35:51,447 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:51,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:51,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:51,450 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:51,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:51,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:51,451 INFO 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-18 17:35:51,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:51,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:51,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:51,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 18 treesize of output 21 [2019-01-18 17:35:51,474 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 21 treesize of output 23 [2019-01-18 17:35:51,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:35:51,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:35:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,512 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:35:51,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,593 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-18 17:35:51,594 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:35:51,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,638 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-18 17:35:51,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,665 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-18 17:35:51,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:35:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,698 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 59 [2019-01-18 17:35:51,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,729 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-18 17:35:51,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:35:51,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:51,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,761 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 72 [2019-01-18 17:35:51,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,794 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-18 17:35:51,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:35:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:51,825 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:51,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:35:51,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:51,860 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-18 17:35:51,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:35:51,878 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-18 17:35:51,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:51,931 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-18 17:35:51,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:51,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:51,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:51,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:51,952 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-18 17:35:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:52,638 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-18 17:35:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:52,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:35:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:52,641 INFO L225 Difference]: With dead ends: 181 [2019-01-18 17:35:52,641 INFO L226 Difference]: Without dead ends: 180 [2019-01-18 17:35:52,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-18 17:35:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-18 17:35:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 17:35:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-18 17:35:52,746 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-18 17:35:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:52,746 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-18 17:35:52,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:35:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-18 17:35:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:52,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:52,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:52,747 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-18 17:35:52,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:52,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:52,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:52,976 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-18 17:35:52,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:52,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:52,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:52,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:52,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:52,977 INFO 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-18 17:35:52,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:52,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:52,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:35:52,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:52,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:53,002 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 18 treesize of output 21 [2019-01-18 17:35:53,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:35:53,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,013 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 23 treesize of output 37 [2019-01-18 17:35:53,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:35:53,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,031 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:53,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,153 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-18 17:35:53,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,200 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-18 17:35:53,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:53,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:53,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,288 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-18 17:35:53,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:53,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,334 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:53,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:53,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,383 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-18 17:35:53,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:53,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,427 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:53,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:53,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,474 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-18 17:35:53,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,511 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:53,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:53,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, 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-18 17:35:53,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:53,562 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-18 17:35:53,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:53,591 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-18 17:35:53,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-18 17:35:53,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:53,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:35:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:35:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:53,703 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-18 17:35:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:55,000 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-18 17:35:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:35:55,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-18 17:35:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:55,003 INFO L225 Difference]: With dead ends: 200 [2019-01-18 17:35:55,003 INFO L226 Difference]: Without dead ends: 199 [2019-01-18 17:35:55,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:35:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-18 17:35:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-18 17:35:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-18 17:35:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-18 17:35:55,095 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-18 17:35:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:55,095 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-18 17:35:55,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:35:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-18 17:35:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:55,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:55,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:55,096 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-18 17:35:55,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:55,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:55,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:55,308 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-18 17:35:55,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:55,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:55,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:55,308 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-18 17:35:55,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:55,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:55,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:55,311 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:35:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:55,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:55,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:55,312 INFO 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-18 17:35:55,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:55,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:55,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:55,333 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 18 treesize of output 21 [2019-01-18 17:35:55,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,337 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 21 treesize of output 27 [2019-01-18 17:35:55,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,343 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 23 treesize of output 37 [2019-01-18 17:35:55,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,349 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 25 treesize of output 51 [2019-01-18 17:35:55,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:55,358 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,440 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-18 17:35:55,440 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:55,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,484 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-18 17:35:55,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,527 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-18 17:35:55,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:55,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,565 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-18 17:35:55,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:55,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,663 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:55,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:55,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, 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-18 17:35:55,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:55,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-18 17:35:55,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:55,741 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-18 17:35:55,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:55,779 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-18 17:35:55,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:35:55,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:55,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:35:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:35:55,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:35:55,799 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-18 17:35:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:56,343 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-18 17:35:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:35:56,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:35:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:56,344 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:35:56,345 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:35:56,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:35:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-18 17:35:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:35:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-18 17:35:56,448 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-18 17:35:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:56,448 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-18 17:35:56,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:35:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-18 17:35:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:56,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:56,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:56,449 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-18 17:35:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:56,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:56,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:56,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:56,690 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-18 17:35:56,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:56,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:56,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:35:56,691 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-18 17:35:56,691 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:35:56,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:35:56,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:35:56,694 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:35:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:56,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:35:56,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:56,695 INFO 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-18 17:35:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:56,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:56,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:56,723 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 18 treesize of output 21 [2019-01-18 17:35:56,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,731 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 21 treesize of output 27 [2019-01-18 17:35:56,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,738 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 23 treesize of output 37 [2019-01-18 17:35:56,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,747 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 25 treesize of output 51 [2019-01-18 17:35:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,755 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:56,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,844 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-18 17:35:56,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:56,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,881 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-18 17:35:56,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:56,922 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-18 17:35:56,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:56,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:56,960 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-18 17:35:56,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:57,009 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-18 17:35:57,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:57,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:57,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, 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-18 17:35:57,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:57,105 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-18 17:35:57,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:35:57,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:57,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:57,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:35:57,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:57,195 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-18 17:35:57,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:57,219 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-18 17:35:57,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:57,274 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-18 17:35:57,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:57,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:35:57,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:57,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:35:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:35:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:35:57,293 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-18 17:35:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:58,129 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-18 17:35:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:58,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:35:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:58,132 INFO L225 Difference]: With dead ends: 197 [2019-01-18 17:35:58,132 INFO L226 Difference]: Without dead ends: 196 [2019-01-18 17:35:58,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:35:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-18 17:35:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-18 17:35:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-18 17:35:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-18 17:35:58,243 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-18 17:35:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:58,244 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-18 17:35:58,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:35:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-18 17:35:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:35:58,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:58,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:35:58,244 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:58,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-18 17:35:58,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:58,413 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-18 17:35:58,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:58,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:58,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:58,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:58,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:58,414 INFO 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-18 17:35:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:58,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:58,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:35:58,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:58,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:58,432 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 18 treesize of output 21 [2019-01-18 17:35:58,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,439 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 21 treesize of output 27 [2019-01-18 17:35:58,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,444 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 23 treesize of output 37 [2019-01-18 17:35:58,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,452 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 25 treesize of output 51 [2019-01-18 17:35:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,460 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:35:58,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,542 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-18 17:35:58,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:35:58,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,661 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-18 17:35:58,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,700 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-18 17:35:58,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:35:58,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,733 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:58,734 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-18 17:35:58,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,779 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-18 17:35:58,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-18 17:35:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,825 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 82 [2019-01-18 17:35:58,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:35:58,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:35:58,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:35:58,906 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:35:58,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 40 treesize of output 96 [2019-01-18 17:35:58,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:58,954 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-18 17:35:58,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:35:58,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-18 17:35:58,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:59,037 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-18 17:35:59,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:59,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:35:59,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:35:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:35:59,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:35:59,056 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-18 17:35:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:59,917 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-18 17:35:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:35:59,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:35:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:59,920 INFO L225 Difference]: With dead ends: 195 [2019-01-18 17:35:59,920 INFO L226 Difference]: Without dead ends: 189 [2019-01-18 17:35:59,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:35:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-18 17:36:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-18 17:36:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-18 17:36:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-18 17:36:00,065 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-18 17:36:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:00,065 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-18 17:36:00,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:36:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-18 17:36:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:00,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:00,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:00,066 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-18 17:36:00,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:00,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:00,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:00,196 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-18 17:36:00,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:00,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:00,197 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:00,197 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-18 17:36:00,200 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:00,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:00,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:00,203 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:00,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:00,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:00,204 INFO 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-18 17:36:00,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:00,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:00,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:00,228 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 18 treesize of output 21 [2019-01-18 17:36:00,232 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 21 treesize of output 23 [2019-01-18 17:36:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:00,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:00,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,262 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:00,262 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,328 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-18 17:36:00,328 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:00,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,370 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-18 17:36:00,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,396 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-18 17:36:00,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:00,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,422 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:00,423 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-18 17:36:00,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,454 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-18 17:36:00,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:36:00,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:00,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-18 17:36:00,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:00,512 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-18 17:36:00,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:36:00,534 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-18 17:36:00,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:00,571 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-18 17:36:00,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:00,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:00,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:00,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:00,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:00,593 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-18 17:36:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:01,118 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-18 17:36:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:36:01,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:01,120 INFO L225 Difference]: With dead ends: 157 [2019-01-18 17:36:01,120 INFO L226 Difference]: Without dead ends: 156 [2019-01-18 17:36:01,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:36:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-18 17:36:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-18 17:36:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:36:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-18 17:36:01,234 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-18 17:36:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:01,234 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-18 17:36:01,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-18 17:36:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:01,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:01,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:01,235 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-18 17:36:01,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:01,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:01,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:01,396 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-18 17:36:01,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:01,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:01,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:01,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:01,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:01,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 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-18 17:36:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:01,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:01,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:01,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:01,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:01,418 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 18 treesize of output 21 [2019-01-18 17:36:01,434 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 21 treesize of output 23 [2019-01-18 17:36:01,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:01,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:01,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:01,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,575 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-18 17:36:01,576 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:01,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,643 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-18 17:36:01,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,672 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-18 17:36:01,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:01,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:01,713 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-18 17:36:01,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,754 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-18 17:36:01,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-18 17:36:01,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,802 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-18 17:36:01,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,838 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-18 17:36:01,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-18 17:36:01,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:01,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:01,895 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-18 17:36:01,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:01,927 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-18 17:36:01,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:36:01,946 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-18 17:36:01,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:02,001 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-18 17:36:02,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:36:02,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:36:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:36:02,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:36:02,021 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-18 17:36:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:02,674 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-18 17:36:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:36:02,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:36:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:02,677 INFO L225 Difference]: With dead ends: 178 [2019-01-18 17:36:02,677 INFO L226 Difference]: Without dead ends: 177 [2019-01-18 17:36:02,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:36:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-18 17:36:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-18 17:36:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-18 17:36:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-18 17:36:02,777 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-18 17:36:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:02,777 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-18 17:36:02,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:36:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-18 17:36:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:02,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:02,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:02,778 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-18 17:36:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:02,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:02,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:03,018 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-18 17:36:03,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:03,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:03,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:03,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:03,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:03,020 INFO 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-18 17:36:03,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:03,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:03,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:03,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:03,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:03,037 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 18 treesize of output 21 [2019-01-18 17:36:03,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,041 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 21 treesize of output 27 [2019-01-18 17:36:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,044 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 23 treesize of output 37 [2019-01-18 17:36:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,052 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 25 treesize of output 51 [2019-01-18 17:36:03,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:03,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,135 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-18 17:36:03,136 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:03,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:36:03,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,212 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-18 17:36:03,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,246 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:03,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 38 treesize of output 81 [2019-01-18 17:36:03,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:36:03,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:03,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,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, 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-18 17:36:03,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,374 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-18 17:36:03,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:03,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:03,417 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:03,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-18 17:36:03,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:03,466 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-18 17:36:03,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:03,491 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-18 17:36:03,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:03,545 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-18 17:36:03,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:03,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:36:03,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:03,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:36:03,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:36:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:03,564 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-18 17:36:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:04,525 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-18 17:36:04,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:36:04,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:36:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:04,528 INFO L225 Difference]: With dead ends: 204 [2019-01-18 17:36:04,528 INFO L226 Difference]: Without dead ends: 203 [2019-01-18 17:36:04,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:36:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-18 17:36:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-18 17:36:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-18 17:36:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-18 17:36:04,631 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-18 17:36:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-18 17:36:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:36:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-18 17:36:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:04,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:04,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:04,633 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-18 17:36:04,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:04,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:04,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:04,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:04,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:04,741 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-18 17:36:04,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:04,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:04,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:04,741 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-18 17:36:04,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:04,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:04,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:04,744 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:04,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:04,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:04,744 INFO 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-18 17:36:04,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:04,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:04,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:04,763 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 18 treesize of output 21 [2019-01-18 17:36:04,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:36:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:04,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,789 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:04,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:04,856 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-18 17:36:04,857 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:04,981 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-18 17:36:04,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:05,005 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-18 17:36:05,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:05,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,032 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:05,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-18 17:36:05,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:05,062 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-18 17:36:05,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:36:05,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:05,151 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 69 [2019-01-18 17:36:05,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:05,181 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-18 17:36:05,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:36:05,200 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-18 17:36:05,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:05,230 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-18 17:36:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:36:05,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:05,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:36:05,249 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-18 17:36:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:05,827 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-18 17:36:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:36:05,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:05,829 INFO L225 Difference]: With dead ends: 178 [2019-01-18 17:36:05,830 INFO L226 Difference]: Without dead ends: 177 [2019-01-18 17:36:05,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-18 17:36:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-18 17:36:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:36:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-18 17:36:05,933 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-18 17:36:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:05,933 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-18 17:36:05,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-18 17:36:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:05,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:05,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:05,934 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-18 17:36:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:05,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:05,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:06,008 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-18 17:36:06,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:06,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:06,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:06,009 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-18 17:36:06,010 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:06,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:06,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:06,012 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:06,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:06,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:06,012 INFO 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-18 17:36:06,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:06,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:06,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:06,028 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 18 treesize of output 21 [2019-01-18 17:36:06,036 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 21 treesize of output 23 [2019-01-18 17:36:06,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:36:06,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:06,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:06,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,124 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-18 17:36:06,124 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:06,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,154 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:36:06,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:36:06,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36: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, 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 50 [2019-01-18 17:36:06,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,210 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-18 17:36:06,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:36:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:06,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:06,244 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-18 17:36:06,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:06,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:36:06,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:06,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:36:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:36:06,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:36:06,263 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-18 17:36:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:06,651 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-18 17:36:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:36:06,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:36:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:06,653 INFO L225 Difference]: With dead ends: 134 [2019-01-18 17:36:06,653 INFO L226 Difference]: Without dead ends: 133 [2019-01-18 17:36:06,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-18 17:36:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-18 17:36:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-18 17:36:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:36:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-18 17:36:06,755 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-18 17:36:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:06,755 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-18 17:36:06,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:36:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-18 17:36:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:06,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:06,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:06,755 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-18 17:36:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:06,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:06,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:06,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:06,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:06,912 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-18 17:36:06,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:06,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:06,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:06,913 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-18 17:36:06,914 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:06,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:06,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:06,917 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:06,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:06,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:06,917 INFO 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-18 17:36:06,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:06,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:06,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:06,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 18 treesize of output 21 [2019-01-18 17:36:06,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,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 21 treesize of output 27 [2019-01-18 17:36:06,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,941 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 23 treesize of output 37 [2019-01-18 17:36:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,949 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 25 treesize of output 51 [2019-01-18 17:36:06,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:06,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:06,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:06,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,040 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-18 17:36:07,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:07,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,074 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-18 17:36:07,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,116 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-18 17:36:07,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:07,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-18 17:36:07,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,198 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-18 17:36:07,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:07,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:07,234 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-18 17:36:07,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:07,290 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-18 17:36:07,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:07,312 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-18 17:36:07,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:07,347 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-18 17:36:07,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:07,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:07,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:07,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:07,367 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-18 17:36:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:07,949 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-18 17:36:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:36:07,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:07,952 INFO L225 Difference]: With dead ends: 143 [2019-01-18 17:36:07,952 INFO L226 Difference]: Without dead ends: 142 [2019-01-18 17:36:07,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 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-18 17:36:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-18 17:36:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-18 17:36:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:36:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-18 17:36:08,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-18 17:36:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:08,056 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-18 17:36:08,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-18 17:36:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:08,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:08,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:08,057 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-18 17:36:08,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:08,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:08,286 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-18 17:36:08,314 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-18 17:36:08,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:08,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:08,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:08,315 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-18 17:36:08,315 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:08,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:08,318 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:08,321 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:08,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:08,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:08,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 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-18 17:36:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:08,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:08,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:08,373 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 18 treesize of output 21 [2019-01-18 17:36:08,411 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 21 treesize of output 23 [2019-01-18 17:36:08,493 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 23 treesize of output 25 [2019-01-18 17:36:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,630 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-18 17:36:08,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:08,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:08,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,701 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-18 17:36:08,702 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:08,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,732 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:36:08,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,748 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-18 17:36:08,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:08,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,771 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 26 treesize of output 40 [2019-01-18 17:36:08,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,789 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-18 17:36:08,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:08,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:08,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:08,811 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 56 [2019-01-18 17:36:08,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:08,834 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-18 17:36:08,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:36:08,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-18 17:36:08,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:36:08,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:08,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:36:08,891 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-18 17:36:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:09,376 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-18 17:36:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:09,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:09,378 INFO L225 Difference]: With dead ends: 151 [2019-01-18 17:36:09,379 INFO L226 Difference]: Without dead ends: 150 [2019-01-18 17:36:09,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:36:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-18 17:36:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-18 17:36:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-18 17:36:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-18 17:36:09,489 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-18 17:36:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:09,489 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-18 17:36:09,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-18 17:36:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:09,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:09,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:09,490 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:09,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-18 17:36:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:09,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:09,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:09,650 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-18 17:36:09,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:09,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:09,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:09,650 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-18 17:36:09,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:09,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:09,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:09,653 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:36:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:09,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:09,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:09,653 INFO 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-18 17:36:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:09,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:09,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:09,673 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 18 treesize of output 21 [2019-01-18 17:36:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:36:09,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,683 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 23 treesize of output 37 [2019-01-18 17:36:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,699 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 25 treesize of output 51 [2019-01-18 17:36:09,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,712 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:09,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,793 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-18 17:36:09,794 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:09,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:09,824 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-18 17:36:09,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,982 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-18 17:36:09,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:10,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,019 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:10,020 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-18 17:36:10,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:10,060 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-18 17:36:10,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:10,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:36:10,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:10,142 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-18 17:36:10,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:10,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:10,266 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-18 17:36:10,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:10,315 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-18 17:36:10,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:10,337 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-18 17:36:10,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:10,381 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-18 17:36:10,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:10,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:36:10,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:10,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:36:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:36:10,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:10,400 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-18 17:36:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:11,266 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-18 17:36:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:11,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:36:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:11,269 INFO L225 Difference]: With dead ends: 215 [2019-01-18 17:36:11,269 INFO L226 Difference]: Without dead ends: 214 [2019-01-18 17:36:11,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:36:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-18 17:36:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-18 17:36:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-18 17:36:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-18 17:36:11,400 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-18 17:36:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:11,400 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-18 17:36:11,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:36:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-18 17:36:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:11,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:11,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:11,402 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-18 17:36:11,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:11,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:11,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:11,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:11,422 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-18 17:36:11,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:11,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:11,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:11,423 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-18 17:36:11,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:11,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:11,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:11,426 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:36:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:11,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:11,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:11,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 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-18 17:36:11,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:11,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:11,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:11,455 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 18 treesize of output 21 [2019-01-18 17:36:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:36:11,467 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 23 treesize of output 25 [2019-01-18 17:36:11,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:36:11,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, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-18 17:36:11,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,554 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-18 17:36:11,555 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-18 17:36:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:11,559 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-18 17:36:11,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:11,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 17:36:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:11,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:11,574 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-18 17:36:11,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:36:11,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:36:11,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:36:11,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:36:11,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:36:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:36:11,593 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-18 17:36:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:11,931 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-18 17:36:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:36:11,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-18 17:36:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:11,936 INFO L225 Difference]: With dead ends: 280 [2019-01-18 17:36:11,936 INFO L226 Difference]: Without dead ends: 275 [2019-01-18 17:36:11,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:36:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-18 17:36:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-18 17:36:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-18 17:36:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-18 17:36:12,184 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-18 17:36:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:12,184 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-18 17:36:12,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:36:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-18 17:36:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:12,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:12,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:12,185 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-18 17:36:12,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:12,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:12,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:12,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:12,329 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-18 17:36:12,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:12,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:12,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:12,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:12,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:12,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:12,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:12,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:12,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:12,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:12,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:12,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:36:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,357 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 21 treesize of output 27 [2019-01-18 17:36:12,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:36:12,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,382 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 25 treesize of output 51 [2019-01-18 17:36:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:12,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,475 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-18 17:36:12,475 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:12,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,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 72 [2019-01-18 17:36:12,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,554 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-18 17:36:12,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:36:12,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,643 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-18 17:36:12,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:12,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,682 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:12,683 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-18 17:36:12,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,734 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-18 17:36:12,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:12,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:12,776 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:12,777 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-18 17:36:12,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:12,821 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-18 17:36:12,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:12,848 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-18 17:36:12,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:12,913 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-18 17:36:12,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:12,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:36:12,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:12,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:36:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:36:12,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:12,934 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-18 17:36:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:13,954 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-18 17:36:13,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:36:13,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:36:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:13,959 INFO L225 Difference]: With dead ends: 329 [2019-01-18 17:36:13,959 INFO L226 Difference]: Without dead ends: 328 [2019-01-18 17:36:13,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:36:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-18 17:36:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-18 17:36:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-18 17:36:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-18 17:36:14,236 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-18 17:36:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:14,236 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-18 17:36:14,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:36:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-18 17:36:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:14,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:14,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:14,237 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-18 17:36:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:14,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:14,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:14,366 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-18 17:36:14,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:14,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:14,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:14,366 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-18 17:36:14,367 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:14,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:14,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:14,369 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:14,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:14,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:14,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:14,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:14,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:14,397 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 18 treesize of output 21 [2019-01-18 17:36:14,405 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 21 treesize of output 23 [2019-01-18 17:36:14,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:14,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:14,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,430 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:14,431 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,499 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-18 17:36:14,499 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:14,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:36:14,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,568 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-18 17:36:14,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:14,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:14,594 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-18 17:36:14,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:14,625 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-18 17:36:14,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:14,646 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-18 17:36:14,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:14,669 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-18 17:36:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:14,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:36:14,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:14,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:36:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:36:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:36:14,689 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-18 17:36:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:15,246 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-18 17:36:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:36:15,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:36:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:15,250 INFO L225 Difference]: With dead ends: 290 [2019-01-18 17:36:15,250 INFO L226 Difference]: Without dead ends: 286 [2019-01-18 17:36:15,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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-18 17:36:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-18 17:36:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-18 17:36:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-18 17:36:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-18 17:36:15,527 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-18 17:36:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:15,527 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-18 17:36:15,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:36:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-18 17:36:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:15,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:15,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:15,529 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:15,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-18 17:36:15,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:15,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:15,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:15,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:15,649 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-18 17:36:15,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:15,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:15,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:15,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:15,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:15,650 INFO 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-18 17:36:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:15,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:15,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:15,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:15,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:15,668 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 18 treesize of output 21 [2019-01-18 17:36:15,672 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 21 treesize of output 23 [2019-01-18 17:36:15,679 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 23 treesize of output 25 [2019-01-18 17:36:15,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:15,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:15,711 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,770 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-18 17:36:15,770 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:15,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,802 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:36:15,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,819 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-18 17:36:15,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:15,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,841 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:15,841 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-18 17:36:15,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,860 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-18 17:36:15,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:15,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:15,884 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 26 treesize of output 40 [2019-01-18 17:36:15,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:15,902 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-18 17:36:15,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:15,918 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-18 17:36:15,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:15,952 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-18 17:36:15,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:15,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:15,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:15,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:15,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:15,971 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-18 17:36:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:16,598 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-18 17:36:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:16,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:16,602 INFO L225 Difference]: With dead ends: 307 [2019-01-18 17:36:16,602 INFO L226 Difference]: Without dead ends: 302 [2019-01-18 17:36:16,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-18 17:36:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-18 17:36:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-18 17:36:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-18 17:36:16,867 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-18 17:36:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:16,868 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-18 17:36:16,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-18 17:36:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:16,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:16,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:16,868 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-18 17:36:16,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:16,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:16,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:17,201 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-18 17:36:17,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:17,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:17,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:17,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:17,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:17,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 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-18 17:36:17,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:17,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:17,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:17,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:17,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:17,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:36:17,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,222 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 21 treesize of output 27 [2019-01-18 17:36:17,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,227 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 23 treesize of output 37 [2019-01-18 17:36:17,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,232 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 25 treesize of output 51 [2019-01-18 17:36:17,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,239 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:17,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,320 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:17,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,360 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-18 17:36:17,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,402 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-18 17:36:17,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:17,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:17,444 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-18 17:36:17,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,488 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-18 17:36:17,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:17,530 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-18 17:36:17,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,581 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-18 17:36:17,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,622 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-18 17:36:17,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,667 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-18 17:36:17,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,705 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:17,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:17,706 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-18 17:36:17,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:17,756 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-18 17:36:17,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:17,789 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-18 17:36:17,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:17,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:17,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-18 17:36:17,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:17,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:36:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:36:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:36:17,899 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-18 17:36:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:19,187 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-18 17:36:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:19,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-18 17:36:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:19,191 INFO L225 Difference]: With dead ends: 284 [2019-01-18 17:36:19,191 INFO L226 Difference]: Without dead ends: 279 [2019-01-18 17:36:19,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:36:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-18 17:36:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-18 17:36:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-18 17:36:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-18 17:36:19,446 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-18 17:36:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:19,446 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-18 17:36:19,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:36:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-18 17:36:19,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:19,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:19,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:19,447 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-18 17:36:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:19,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:19,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:19,735 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-18 17:36:20,019 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-18 17:36:20,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:20,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:20,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:20,020 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-18 17:36:20,021 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:20,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:20,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:20,023 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:20,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:20,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:20,024 INFO 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-18 17:36:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:20,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:20,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:20,053 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 18 treesize of output 21 [2019-01-18 17:36:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:36:20,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,065 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 23 treesize of output 37 [2019-01-18 17:36:20,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,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 25 treesize of output 51 [2019-01-18 17:36:20,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,080 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:20,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,108 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,162 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-18 17:36:20,163 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:20,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:36:20,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,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-18 17:36:20,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:20,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:20,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, 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-18 17:36:20,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:20,320 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-18 17:36:20,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:20,340 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-18 17:36:20,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:20,351 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-18 17:36:20,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:20,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:36:20,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:20,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:36:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:36:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:36:20,372 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-18 17:36:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:20,918 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-18 17:36:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:36:20,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:36:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:20,921 INFO L225 Difference]: With dead ends: 230 [2019-01-18 17:36:20,922 INFO L226 Difference]: Without dead ends: 223 [2019-01-18 17:36:20,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:36:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-18 17:36:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-18 17:36:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-18 17:36:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-18 17:36:21,190 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-18 17:36:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:21,190 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-18 17:36:21,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:36:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-18 17:36:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:21,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:21,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:21,191 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-18 17:36:21,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:21,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:21,597 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-18 17:36:21,614 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-18 17:36:21,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:21,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:21,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:21,615 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-18 17:36:21,616 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:21,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:21,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:21,618 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:21,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:21,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:21,619 INFO 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-18 17:36:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:21,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:21,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:21,645 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 18 treesize of output 21 [2019-01-18 17:36:21,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,648 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 21 treesize of output 27 [2019-01-18 17:36:21,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,653 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 23 treesize of output 37 [2019-01-18 17:36:21,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,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 25 treesize of output 51 [2019-01-18 17:36:21,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,666 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:21,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,748 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-18 17:36:21,749 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:21,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,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, 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-18 17:36:21,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:36:21,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,858 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-18 17:36:21,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:21,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-18 17:36:21,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:21,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:21,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:21,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 38 treesize of output 104 [2019-01-18 17:36:21,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:22,019 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-18 17:36:22,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:22,052 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-18 17:36:22,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 17:36:22,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:36:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:36:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:36:22,109 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-18 17:36:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:22,837 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-18 17:36:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:22,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 17:36:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:22,841 INFO L225 Difference]: With dead ends: 254 [2019-01-18 17:36:22,841 INFO L226 Difference]: Without dead ends: 253 [2019-01-18 17:36:22,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-18 17:36:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-18 17:36:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-18 17:36:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-18 17:36:23,132 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-18 17:36:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:23,133 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-18 17:36:23,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:36:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-18 17:36:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:23,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:23,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:23,133 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-18 17:36:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:23,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:23,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:23,205 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-18 17:36:23,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:23,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:23,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:23,206 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-18 17:36:23,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:23,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:23,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:23,210 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:23,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:23,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:23,212 INFO 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-18 17:36:23,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:23,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:23,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:23,241 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 18 treesize of output 21 [2019-01-18 17:36:23,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:36:23,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,255 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 23 treesize of output 37 [2019-01-18 17:36:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:36:23,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,275 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:23,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,364 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-18 17:36:23,364 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:23,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:36:23,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,443 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-18 17:36:23,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:23,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:23,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:23,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, 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-18 17:36:23,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:23,519 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-18 17:36:23,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:23,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-18 17:36:23,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:23,573 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-18 17:36:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:23,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:36:23,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:23,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:36:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:36:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:36:23,592 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-18 17:36:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:24,062 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-18 17:36:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:36:24,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:36:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:24,064 INFO L225 Difference]: With dead ends: 223 [2019-01-18 17:36:24,064 INFO L226 Difference]: Without dead ends: 216 [2019-01-18 17:36:24,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:36:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-18 17:36:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-18 17:36:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-18 17:36:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-18 17:36:24,355 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-18 17:36:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:24,355 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-18 17:36:24,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:36:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-18 17:36:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:24,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:24,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:24,356 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-18 17:36:24,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:24,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:24,500 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-18 17:36:24,609 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-18 17:36:24,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:24,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:24,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:24,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:24,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:24,610 INFO 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-18 17:36:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:24,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:24,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:24,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:24,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:24,628 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 18 treesize of output 21 [2019-01-18 17:36:24,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,631 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 21 treesize of output 27 [2019-01-18 17:36:24,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:36:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:36:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:24,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,742 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-18 17:36:24,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:24,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,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, 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-18 17:36:24,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,824 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-18 17:36:24,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:24,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,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, 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-18 17:36:24,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:24,911 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-18 17:36:24,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:24,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:24,954 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:24,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:36:24,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:25,005 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-18 17:36:25,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:25,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:25,051 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:25,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 38 treesize of output 98 [2019-01-18 17:36:25,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:25,101 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-18 17:36:25,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:25,131 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-18 17:36:25,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:25,198 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-18 17:36:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:36:25,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:25,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:36:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:36:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:36:25,218 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-18 17:36:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:26,300 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-18 17:36:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:36:26,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:36:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:26,304 INFO L225 Difference]: With dead ends: 285 [2019-01-18 17:36:26,304 INFO L226 Difference]: Without dead ends: 279 [2019-01-18 17:36:26,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:36:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-18 17:36:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-18 17:36:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-18 17:36:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-18 17:36:26,574 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-18 17:36:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:26,574 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-18 17:36:26,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:36:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-18 17:36:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:26,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:26,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:26,575 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-18 17:36:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:26,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:26,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:26,688 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-18 17:36:26,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:26,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:26,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:26,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:26,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:26,689 INFO 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-18 17:36:26,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:26,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:26,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:26,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:26,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:26,711 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 18 treesize of output 21 [2019-01-18 17:36:26,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,714 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 21 treesize of output 27 [2019-01-18 17:36:26,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,724 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 23 treesize of output 37 [2019-01-18 17:36:26,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,735 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 25 treesize of output 51 [2019-01-18 17:36:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,746 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:26,747 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:26,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:26,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:26,801 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:26,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:26,829 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-18 17:36:26,830 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:26,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:26,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,024 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-01-18 17:36:27,025 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-18 17:36:27,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:27,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:36:27,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:27,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:27,147 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-18 17:36:27,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:27,196 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-18 17:36:27,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:27,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:27,269 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-18 17:36:27,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:27,322 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-18 17:36:27,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:27,349 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-18 17:36:27,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:27,380 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-18 17:36:27,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:27,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:27,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:27,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:27,400 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-18 17:36:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:28,182 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-18 17:36:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:28,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:28,186 INFO L225 Difference]: With dead ends: 252 [2019-01-18 17:36:28,186 INFO L226 Difference]: Without dead ends: 247 [2019-01-18 17:36:28,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-18 17:36:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-18 17:36:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-18 17:36:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-18 17:36:28,453 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-18 17:36:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:28,454 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-18 17:36:28,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-18 17:36:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:28,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:28,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:28,454 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-18 17:36:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:28,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:28,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:28,532 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-18 17:36:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:28,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:28,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:28,532 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-18 17:36:28,533 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:28,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:28,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:28,535 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:28,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:28,535 INFO 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-18 17:36:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:28,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:28,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:36:28,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,561 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 21 treesize of output 27 [2019-01-18 17:36:28,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,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 23 treesize of output 37 [2019-01-18 17:36:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,575 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 25 treesize of output 51 [2019-01-18 17:36:28,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:28,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,664 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-18 17:36:28,664 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:28,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,697 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-18 17:36:28,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,738 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-18 17:36:28,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:28,772 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-18 17:36:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:28,817 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-18 17:36:28,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:28,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:28,857 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-18 17:36:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:28,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:36:28,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:28,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:36:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:36:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:36:28,877 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-18 17:36:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:29,366 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-18 17:36:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:36:29,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:36:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:29,369 INFO L225 Difference]: With dead ends: 194 [2019-01-18 17:36:29,369 INFO L226 Difference]: Without dead ends: 193 [2019-01-18 17:36:29,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:36:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-18 17:36:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-18 17:36:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-18 17:36:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-18 17:36:29,634 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-18 17:36:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:29,635 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-18 17:36:29,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:36:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-18 17:36:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:29,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:29,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:29,635 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-18 17:36:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:29,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:30,052 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-18 17:36:30,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-18 17:36:30,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:30,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:30,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:30,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:30,170 INFO 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-18 17:36:30,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:30,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:30,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:30,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:30,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:30,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:36:30,190 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 21 treesize of output 23 [2019-01-18 17:36:30,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:30,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:30,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:30,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,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-18 17:36:30,289 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,330 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-18 17:36:30,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,359 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-18 17:36:30,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:30,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 17:36:30,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,418 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-18 17:36:30,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:30,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,445 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:30,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:30,446 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 76 [2019-01-18 17:36:30,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:30,482 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-18 17:36:30,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:36:30,500 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-18 17:36:30,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:30,533 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-18 17:36:30,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:30,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:30,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:30,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:30,553 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-18 17:36:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:31,360 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-18 17:36:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:31,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:36:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:31,362 INFO L225 Difference]: With dead ends: 265 [2019-01-18 17:36:31,362 INFO L226 Difference]: Without dead ends: 264 [2019-01-18 17:36:31,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-18 17:36:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-18 17:36:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-18 17:36:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-18 17:36:31,693 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-18 17:36:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:31,694 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-18 17:36:31,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-18 17:36:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:31,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:31,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:31,694 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-18 17:36:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:31,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:31,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:31,761 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-18 17:36:31,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:31,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:31,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:31,761 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-18 17:36:31,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:31,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:31,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:31,764 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:31,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:31,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:31,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:31,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:31,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:31,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:31,816 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 18 treesize of output 21 [2019-01-18 17:36:31,824 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 21 treesize of output 23 [2019-01-18 17:36:31,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:36:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:31,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:31,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,876 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,920 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-18 17:36:31,921 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:31,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,952 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:36:31,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:31,967 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-18 17:36:31,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:31,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:31,988 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:31,989 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-18 17:36:31,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:32,007 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-18 17:36:32,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:32,023 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-18 17:36:32,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:32,040 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-18 17:36:32,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:32,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:36:32,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:32,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:36:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:36:32,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:36:32,059 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-18 17:36:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:32,557 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-18 17:36:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:36:32,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:36:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:32,559 INFO L225 Difference]: With dead ends: 210 [2019-01-18 17:36:32,559 INFO L226 Difference]: Without dead ends: 203 [2019-01-18 17:36:32,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:36:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-18 17:36:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-18 17:36:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-18 17:36:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-18 17:36:32,889 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-18 17:36:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-18 17:36:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:36:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-18 17:36:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:36:32,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:32,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:32,890 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-18 17:36:32,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:32,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:32,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:32,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:32,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:32,967 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-18 17:36:32,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:32,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:32,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:36:32,968 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-18 17:36:32,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:32,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:32,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:32,970 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:32,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:32,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:32,970 INFO 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-18 17:36:32,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:32,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:32,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:32,992 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 18 treesize of output 21 [2019-01-18 17:36:32,994 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 21 treesize of output 23 [2019-01-18 17:36:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:36:33,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:36:33,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,034 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:36:33,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,103 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-18 17:36:33,103 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:36:33,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,144 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-18 17:36:33,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,171 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-18 17:36:33,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:33,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:33,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 17:36:33,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:33,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-18 17:36:33,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:36:33,273 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-18 17:36:33,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:33,565 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-18 17:36:33,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:33,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:36:33,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:33,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:36:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:36:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:36:33,584 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-18 17:36:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:34,147 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-18 17:36:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:36:34,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:36:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:34,149 INFO L225 Difference]: With dead ends: 216 [2019-01-18 17:36:34,150 INFO L226 Difference]: Without dead ends: 212 [2019-01-18 17:36:34,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:36:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-18 17:36:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-18 17:36:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-18 17:36:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-18 17:36:34,497 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-18 17:36:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:34,497 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-18 17:36:34,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:36:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-18 17:36:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:34,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:34,498 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:34,498 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-18 17:36:34,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:34,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:34,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:34,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:34,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:34,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:34,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:34,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:34,584 INFO 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-18 17:36:34,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:34,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:34,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:36:34,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:34,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:34,604 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 18 treesize of output 21 [2019-01-18 17:36:34,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:36:34,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,615 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 23 treesize of output 37 [2019-01-18 17:36:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,623 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 25 treesize of output 51 [2019-01-18 17:36:34,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36: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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:34,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:36:34,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:34,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,748 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-18 17:36:34,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,787 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-18 17:36:34,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:34,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,824 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 78 [2019-01-18 17:36:34,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,871 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-18 17:36:34,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:34,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:34,906 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-18 17:36:34,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:34,953 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-18 17:36:34,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:34,974 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-18 17:36:34,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:34,996 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-18 17:36:35,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:35,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:36:35,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:35,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:35,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:36:35,017 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-18 17:36:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:36,043 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-18 17:36:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:36,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:36:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:36,046 INFO L225 Difference]: With dead ends: 401 [2019-01-18 17:36:36,046 INFO L226 Difference]: Without dead ends: 397 [2019-01-18 17:36:36,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-18 17:36:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-18 17:36:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-18 17:36:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-18 17:36:36,665 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-18 17:36:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:36,665 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-18 17:36:36,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-18 17:36:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:36,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:36,666 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:36,666 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-18 17:36:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:36,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:36,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:36:36,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:36:36,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:36:36,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:36:36,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:36:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:36:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:36:36,718 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-18 17:36:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:37,322 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-18 17:36:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:36:37,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-18 17:36:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:37,324 INFO L225 Difference]: With dead ends: 347 [2019-01-18 17:36:37,325 INFO L226 Difference]: Without dead ends: 342 [2019-01-18 17:36:37,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:36:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-18 17:36:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-18 17:36:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-18 17:36:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-18 17:36:37,944 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-18 17:36:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:37,944 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-18 17:36:37,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:36:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-18 17:36:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:37,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:37,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:37,946 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-18 17:36:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:37,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:38,255 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-18 17:36:38,366 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-18 17:36:38,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:38,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:38,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:36:38,367 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-18 17:36:38,368 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:38,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:38,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:38,370 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:36:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:38,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:38,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:38,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:38,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:38,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:38,386 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 18 treesize of output 21 [2019-01-18 17:36:38,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,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 21 treesize of output 27 [2019-01-18 17:36:38,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:36:38,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:36:38,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:38,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,529 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,581 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,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, 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-18 17:36:38,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,656 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-18 17:36:38,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:38,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,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, 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-18 17:36:38,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,739 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-18 17:36:38,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:38,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:38,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, 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-18 17:36:38,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,834 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-18 17:36:38,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:38,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,877 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:38,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:36:38,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:38,928 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-18 17:36:38,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:38,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,967 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:38,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:38,969 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-18 17:36:38,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:39,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-18 17:36:39,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:39,050 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-18 17:36:39,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:39,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:39,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 17:36:39,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:39,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:36:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:36:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:36:39,131 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-18 17:36:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:40,791 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-18 17:36:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:40,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-18 17:36:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:40,794 INFO L225 Difference]: With dead ends: 471 [2019-01-18 17:36:40,795 INFO L226 Difference]: Without dead ends: 470 [2019-01-18 17:36:40,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:36:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-18 17:36:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-18 17:36:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-18 17:36:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-18 17:36:41,431 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-18 17:36:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:41,432 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-18 17:36:41,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:36:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-18 17:36:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:41,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:41,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:41,433 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-18 17:36:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:41,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:41,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:41,595 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2019-01-18 17:36:41,710 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-18 17:36:41,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:41,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:41,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:41,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:41,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:41,711 INFO 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-18 17:36:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:41,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:41,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:36:41,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:41,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:41,732 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 18 treesize of output 21 [2019-01-18 17:36:41,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,738 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 21 treesize of output 27 [2019-01-18 17:36:41,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36: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 23 treesize of output 37 [2019-01-18 17:36:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,748 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 25 treesize of output 51 [2019-01-18 17:36:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:41,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,851 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,891 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-18 17:36:41,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:41,932 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-18 17:36:41,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:41,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:41,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, 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-18 17:36:41,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,020 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-18 17:36:42,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:42,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,063 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-18 17:36:42,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,113 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-18 17:36:42,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:42,153 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 96 [2019-01-18 17:36:42,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,205 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-18 17:36:42,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:42,248 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:42,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, 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 96 [2019-01-18 17:36:42,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,298 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-18 17:36:42,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:42,325 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-18 17:36:42,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:42,404 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-18 17:36:42,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:42,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:36:42,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:42,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:36:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:36:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:36:42,423 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-18 17:36:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:44,232 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-18 17:36:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:44,232 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-18 17:36:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:44,235 INFO L225 Difference]: With dead ends: 483 [2019-01-18 17:36:44,235 INFO L226 Difference]: Without dead ends: 482 [2019-01-18 17:36:44,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:36:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-18 17:36:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-18 17:36:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-18 17:36:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-18 17:36:44,928 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-18 17:36:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:44,928 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-18 17:36:44,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:36:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-18 17:36:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:44,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:44,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:44,929 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-18 17:36:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:44,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:44,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:45,048 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-18 17:36:45,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:45,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:45,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:36:45,049 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:36:45,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:45,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:45,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:45,052 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:45,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:45,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:45,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:45,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 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-18 17:36:45,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:45,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:45,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:45,071 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 18 treesize of output 21 [2019-01-18 17:36:45,074 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 21 treesize of output 23 [2019-01-18 17:36:45,082 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 23 treesize of output 25 [2019-01-18 17:36:45,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:45,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:45,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,309 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-18 17:36:45,309 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:36:45,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,377 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-18 17:36:45,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,393 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-18 17:36:45,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-18 17:36:45,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:45,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:45,419 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 56 [2019-01-18 17:36:45,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:45,439 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-18 17:36:45,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:36:45,458 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-18 17:36:45,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:45,493 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-18 17:36:45,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:45,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:45,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:45,511 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-18 17:36:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:46,493 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-18 17:36:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:46,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:36:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:46,495 INFO L225 Difference]: With dead ends: 400 [2019-01-18 17:36:46,495 INFO L226 Difference]: Without dead ends: 393 [2019-01-18 17:36:46,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-18 17:36:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-18 17:36:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-18 17:36:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-18 17:36:47,189 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-18 17:36:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:47,189 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-18 17:36:47,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-18 17:36:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:47,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:47,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:47,190 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-18 17:36:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:47,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:47,318 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-18 17:36:47,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:47,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:47,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:36:47,319 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-18 17:36:47,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:47,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:47,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:47,321 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:47,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:47,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:47,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:47,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:47,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:47,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:47,340 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 18 treesize of output 21 [2019-01-18 17:36:47,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,343 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 21 treesize of output 27 [2019-01-18 17:36:47,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,351 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 23 treesize of output 37 [2019-01-18 17:36:47,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:36:47,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:47,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,449 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-18 17:36:47,449 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:47,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,483 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-18 17:36:47,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,530 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-18 17:36:47,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:47,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,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, 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-18 17:36:47,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,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-18 17:36:47,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:47,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:47,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:47,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 94 [2019-01-18 17:36:47,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:47,809 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-18 17:36:47,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:47,833 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-18 17:36:47,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:47,865 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-18 17:36:47,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:47,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:36:47,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:47,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:36:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:36:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:36:47,884 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-18 17:36:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:48,968 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-18 17:36:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:48,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:36:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:48,970 INFO L225 Difference]: With dead ends: 409 [2019-01-18 17:36:48,970 INFO L226 Difference]: Without dead ends: 397 [2019-01-18 17:36:48,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:36:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-18 17:36:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-18 17:36:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-18 17:36:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-18 17:36:49,667 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-18 17:36:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-18 17:36:49,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:36:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-18 17:36:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:49,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:49,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:49,668 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-18 17:36:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:49,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:49,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:49,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:49,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:49,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:49,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:49,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:36:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:49,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:49,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:49,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:49,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:49,970 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 18 treesize of output 21 [2019-01-18 17:36:49,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,976 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 21 treesize of output 27 [2019-01-18 17:36:49,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:36:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:36:49,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:49,992 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:49,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,033 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,089 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,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, 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-18 17:36:50,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,168 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-18 17:36:50,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:50,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,210 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-18 17:36:50,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,256 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-18 17:36:50,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:50,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,298 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:50,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:36:50,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,353 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-18 17:36:50,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:50,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,398 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:50,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-18 17:36:50,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,446 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-18 17:36:50,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:50,487 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:50,487 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 96 [2019-01-18 17:36:50,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:50,536 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-18 17:36:50,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:50,563 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-18 17:36:50,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:50,644 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-18 17:36:50,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:50,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-18 17:36:50,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:50,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:36:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:36:50,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:36:50,664 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-18 17:36:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:52,606 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-18 17:36:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:52,606 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 17:36:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:52,609 INFO L225 Difference]: With dead ends: 542 [2019-01-18 17:36:52,609 INFO L226 Difference]: Without dead ends: 536 [2019-01-18 17:36:52,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:36:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-18 17:36:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-18 17:36:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-18 17:36:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-18 17:36:53,473 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-18 17:36:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:53,473 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-18 17:36:53,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:36:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-18 17:36:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:53,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:53,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:53,474 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-18 17:36:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:53,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:53,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:53,577 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-18 17:36:53,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:53,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:53,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:36:53,577 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-18 17:36:53,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:53,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:53,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:53,580 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:36:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:53,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:53,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:53,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 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-18 17:36:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:53,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:53,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:53,595 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 18 treesize of output 21 [2019-01-18 17:36:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,600 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 21 treesize of output 27 [2019-01-18 17:36:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:36:53,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,617 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 25 treesize of output 51 [2019-01-18 17:36:53,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:53,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,708 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-18 17:36:53,709 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:53,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-18 17:36:53,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,784 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-18 17:36:53,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:53,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,824 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-18 17:36:53,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,871 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-18 17:36:53,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:53,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:53,911 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:53,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 38 treesize of output 104 [2019-01-18 17:36:53,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:53,963 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-18 17:36:53,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:36:53,988 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-18 17:36:53,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:54,022 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-18 17:36:54,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:54,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:36:54,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:54,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:36:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:36:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:36:54,041 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-18 17:36:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:55,322 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-18 17:36:55,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:36:55,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:36:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:55,324 INFO L225 Difference]: With dead ends: 469 [2019-01-18 17:36:55,324 INFO L226 Difference]: Without dead ends: 465 [2019-01-18 17:36:55,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:36:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-18 17:36:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-18 17:36:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-18 17:36:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-18 17:36:56,274 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-18 17:36:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:56,274 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-18 17:36:56,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:36:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-18 17:36:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:56,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:56,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:56,276 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-18 17:36:56,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:56,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:56,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:56,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:56,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:56,524 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-18 17:36:56,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:56,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:56,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:56,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:56,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:56,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 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-18 17:36:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:56,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:56,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:56,543 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 18 treesize of output 21 [2019-01-18 17:36:56,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:36:56,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,552 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 23 treesize of output 37 [2019-01-18 17:36:56,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,557 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 25 treesize of output 51 [2019-01-18 17:36:56,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,563 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:36:56,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,645 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:36:56,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,685 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-18 17:36:56,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,723 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-18 17:36:56,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:36:56,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:56,759 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-18 17:36:56,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,804 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-18 17:36:56,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-18 17:36:56,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,853 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 82 [2019-01-18 17:36:56,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,897 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-18 17:36:56,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:56,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:56,941 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:56,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 40 treesize of output 96 [2019-01-18 17:36:56,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:56,990 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-18 17:36:56,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:57,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:57,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:36:57,036 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 96 [2019-01-18 17:36:57,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:57,083 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-18 17:36:57,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:36:57,109 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-18 17:36:57,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:57,205 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-18 17:36:57,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:57,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:36:57,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:57,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:36:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:36:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:36:57,225 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-18 17:36:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:58,979 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-18 17:36:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:36:58,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-18 17:36:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:58,983 INFO L225 Difference]: With dead ends: 481 [2019-01-18 17:36:58,983 INFO L226 Difference]: Without dead ends: 480 [2019-01-18 17:36:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:36:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-18 17:36:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-18 17:36:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-18 17:36:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-18 17:36:59,479 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-18 17:36:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:59,479 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-18 17:36:59,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:36:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-18 17:36:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:36:59,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:59,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:36:59,480 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-18 17:36:59,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:59,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:59,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:59,570 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-18 17:36:59,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:59,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:59,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:36:59,571 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 17:36:59,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:36:59,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:36:59,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:36:59,576 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:36:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:59,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:36:59,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:59,576 INFO 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-18 17:36:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:59,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:59,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:36:59,598 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 21 treesize of output 23 [2019-01-18 17:36:59,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-18 17:36:59,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-18 17:36:59,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-18 17:36:59,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,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-18 17:36:59,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-18 17:36:59,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,721 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:36:59,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,737 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-18 17:36:59,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:36:59,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:36:59,758 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 50 [2019-01-18 17:36:59,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:59,778 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-18 17:36:59,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:36:59,793 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-18 17:36:59,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:59,815 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-18 17:36:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:36:59,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:59,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:36:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:36:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:36:59,834 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-18 17:37:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:00,521 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-18 17:37:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:37:00,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-18 17:37:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:00,523 INFO L225 Difference]: With dead ends: 267 [2019-01-18 17:37:00,524 INFO L226 Difference]: Without dead ends: 258 [2019-01-18 17:37:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-18 17:37:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-18 17:37:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-18 17:37:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-18 17:37:01,038 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-18 17:37:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:01,038 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-18 17:37:01,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:37:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-18 17:37:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:01,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:01,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:01,039 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-18 17:37:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:01,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:01,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:01,231 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-18 17:37:01,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:01,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:01,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:01,231 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-18 17:37:01,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:01,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:01,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:01,234 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:37:01,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:01,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:01,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:01,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:01,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:01,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:01,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:01,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 18 treesize of output 21 [2019-01-18 17:37:01,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,260 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 21 treesize of output 27 [2019-01-18 17:37:01,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,267 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 23 treesize of output 37 [2019-01-18 17:37:01,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:37:01,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:01,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,368 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,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, 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-18 17:37:01,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,449 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-18 17:37:01,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:01,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,492 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-18 17:37:01,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,534 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-18 17:37:01,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:01,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,576 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:01,577 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-18 17:37:01,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,627 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-18 17:37:01,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:37:01,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,667 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:01,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:01,669 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-18 17:37:01,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:01,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-18 17:37:01,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:37:01,745 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-18 17:37:01,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:01,822 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-18 17:37:01,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:01,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:37:01,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:01,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:37:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:37:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:01,841 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-18 17:37:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:03,141 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-18 17:37:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:37:03,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:37:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:03,144 INFO L225 Difference]: With dead ends: 309 [2019-01-18 17:37:03,144 INFO L226 Difference]: Without dead ends: 306 [2019-01-18 17:37:03,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:37:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-18 17:37:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-18 17:37:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-18 17:37:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-18 17:37:03,704 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-18 17:37:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:03,704 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-18 17:37:03,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:37:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-18 17:37:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:03,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:03,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:03,705 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-18 17:37:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:03,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:03,813 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-18 17:37:03,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:03,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:03,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:03,814 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 17:37:03,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:03,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:03,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:03,818 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:37:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:03,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:03,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:03,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:03,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:03,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:03,845 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 18 treesize of output 21 [2019-01-18 17:37:03,849 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 21 treesize of output 23 [2019-01-18 17:37:03,857 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 23 treesize of output 25 [2019-01-18 17:37:03,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-18 17:37:03,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-18 17:37:03,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,933 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-18 17:37:03,933 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-18 17:37:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,954 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:37:03,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:37:03,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:03,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:37:03,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:03,988 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-18 17:37:03,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:37:04,002 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-18 17:37:04,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:04,017 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-18 17:37:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 17:37:04,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:04,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:37:04,037 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-18 17:37:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:05,186 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-18 17:37:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:37:05,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:37:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:05,189 INFO L225 Difference]: With dead ends: 379 [2019-01-18 17:37:05,189 INFO L226 Difference]: Without dead ends: 366 [2019-01-18 17:37:05,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:37:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-18 17:37:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-18 17:37:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-18 17:37:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-18 17:37:05,935 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-18 17:37:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:05,935 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-18 17:37:05,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-18 17:37:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:05,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:05,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:05,936 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-18 17:37:05,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:05,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:05,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:05,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:05,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:06,085 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-01-18 17:37:06,168 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-18 17:37:06,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:06,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:06,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:06,169 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-18 17:37:06,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:06,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:06,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:06,172 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:37:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:06,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:06,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:06,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:06,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:06,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:06,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:06,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:37:06,194 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 21 treesize of output 23 [2019-01-18 17:37:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,217 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:06,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,343 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-18 17:37:06,343 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:06,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,387 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-18 17:37:06,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,413 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-18 17:37:06,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:06,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,445 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-18 17:37:06,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,473 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-18 17:37:06,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:06,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,501 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:06,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,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, 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 72 [2019-01-18 17:37:06,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,536 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-18 17:37:06,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:37:06,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:06,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:06,567 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-18 17:37:06,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:06,598 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-18 17:37:06,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:37:06,621 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-18 17:37:06,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:06,664 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-18 17:37:06,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:06,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:37:06,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:06,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:37:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:37:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:06,684 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-18 17:37:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:08,364 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-18 17:37:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:37:08,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-18 17:37:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:08,368 INFO L225 Difference]: With dead ends: 371 [2019-01-18 17:37:08,368 INFO L226 Difference]: Without dead ends: 366 [2019-01-18 17:37:08,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:37:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-18 17:37:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-18 17:37:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-18 17:37:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-18 17:37:09,335 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-18 17:37:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:09,335 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-18 17:37:09,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:37:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-18 17:37:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:09,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:09,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:09,336 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-18 17:37:09,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:09,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:09,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:09,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:09,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:09,466 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-18 17:37:09,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:09,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:09,466 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-18 17:37:09,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:09,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:09,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:09,468 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:37:09,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:09,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:09,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:09,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:09,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:09,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:09,485 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 18 treesize of output 21 [2019-01-18 17:37:09,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,492 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 21 treesize of output 27 [2019-01-18 17:37:09,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,501 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 23 treesize of output 37 [2019-01-18 17:37:09,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,512 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 25 treesize of output 51 [2019-01-18 17:37:09,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:09,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,610 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-18 17:37:09,611 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:09,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,644 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-18 17:37:09,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,687 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-18 17:37:09,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:09,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,724 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:09,724 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-18 17:37:09,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,771 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-18 17:37:09,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,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, 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-18 17:37:09,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,857 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-18 17:37:09,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:09,900 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:09,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, 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-18 17:37:09,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:09,949 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-18 17:37:09,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:37:09,971 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-18 17:37:09,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:37:10,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:37:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:37:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:10,044 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-18 17:37:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:11,533 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-18 17:37:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:11,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:37:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:11,535 INFO L225 Difference]: With dead ends: 285 [2019-01-18 17:37:11,535 INFO L226 Difference]: Without dead ends: 284 [2019-01-18 17:37:11,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:37:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-18 17:37:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-18 17:37:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-18 17:37:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-18 17:37:12,424 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-18 17:37:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:12,424 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-18 17:37:12,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:37:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-18 17:37:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:12,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:12,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:12,425 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-18 17:37:12,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:12,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:12,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:12,696 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-18 17:37:12,747 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-18 17:37:12,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:12,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:12,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:12,748 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-18 17:37:12,748 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:12,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:12,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:12,750 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:12,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:12,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:12,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:12,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:12,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:12,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:37:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,774 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 21 treesize of output 27 [2019-01-18 17:37:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:37:12,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,789 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 25 treesize of output 51 [2019-01-18 17:37:12,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:12,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,876 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-18 17:37:12,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,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, 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-18 17:37:12,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:12,954 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-18 17:37:12,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:12,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:12,989 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:12,990 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-18 17:37:12,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:13,032 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-18 17:37:13,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:13,069 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-18 17:37:13,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:13,118 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-18 17:37:13,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:13,206 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-18 17:37:13,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:13,258 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-18 17:37:13,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:13,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:37:13,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:13,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:13,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:13,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:13,276 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-18 17:37:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:14,681 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-18 17:37:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:37:14,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:37:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:14,683 INFO L225 Difference]: With dead ends: 281 [2019-01-18 17:37:14,683 INFO L226 Difference]: Without dead ends: 274 [2019-01-18 17:37:14,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-18 17:37:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-18 17:37:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-18 17:37:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-18 17:37:15,665 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-18 17:37:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:15,665 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-18 17:37:15,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-18 17:37:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:15,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:15,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:15,666 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:15,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-18 17:37:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:15,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:15,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:15,828 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-18 17:37:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:15,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:15,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:15,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:15,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:15,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:15,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:37:15,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:15,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:15,847 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 18 treesize of output 21 [2019-01-18 17:37:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,853 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 21 treesize of output 27 [2019-01-18 17:37:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,859 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 23 treesize of output 37 [2019-01-18 17:37:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,872 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 25 treesize of output 51 [2019-01-18 17:37:15,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:15,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:15,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:15,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:15,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:15,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:15,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:15,986 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-18 17:37:15,986 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:16,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,023 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-18 17:37:16,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:16,065 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-18 17:37:16,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:16,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,101 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:16,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:37:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:16,145 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-18 17:37:16,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,186 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:16,187 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-18 17:37:16,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:16,229 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-18 17:37:16,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:16,271 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-18 17:37:16,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:16,316 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-18 17:37:16,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:16,341 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-18 17:37:16,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:37:16,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:16,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:37:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:37:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:37:16,427 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-18 17:37:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:18,126 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-18 17:37:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:18,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-18 17:37:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:18,128 INFO L225 Difference]: With dead ends: 295 [2019-01-18 17:37:18,128 INFO L226 Difference]: Without dead ends: 288 [2019-01-18 17:37:18,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:37:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-18 17:37:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-18 17:37:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-18 17:37:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-18 17:37:19,134 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-18 17:37:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:19,134 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-18 17:37:19,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:37:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-18 17:37:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:19,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:19,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:19,135 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:19,135 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-18 17:37:19,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:19,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:19,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:19,285 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-18 17:37:19,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:19,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:19,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:19,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:19,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:19,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:19,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:19,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:19,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:37:19,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:19,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:19,305 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 18 treesize of output 21 [2019-01-18 17:37:19,309 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 21 treesize of output 23 [2019-01-18 17:37:19,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:19,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:19,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:19,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,418 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-18 17:37:19,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:37:19,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,485 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-18 17:37:19,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:19,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,517 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-18 17:37:19,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,549 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-18 17:37:19,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,583 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:19,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:37:19,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,615 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-18 17:37:19,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:19,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:19,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:19,653 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-18 17:37:19,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:19,688 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-18 17:37:19,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:19,708 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-18 17:37:19,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:19,764 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-18 17:37:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:37:19,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:19,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:37:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:37:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:37:19,784 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-18 17:37:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:21,756 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-18 17:37:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:21,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-18 17:37:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:21,758 INFO L225 Difference]: With dead ends: 370 [2019-01-18 17:37:21,759 INFO L226 Difference]: Without dead ends: 363 [2019-01-18 17:37:21,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:37:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-18 17:37:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-18 17:37:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-18 17:37:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-18 17:37:22,860 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-18 17:37:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:22,860 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-18 17:37:22,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:37:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-18 17:37:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:22,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:22,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:22,861 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-18 17:37:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:22,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:22,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:23,010 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-18 17:37:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:23,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:23,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:23,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:23,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:23,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:23,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:23,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:23,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:23,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:37:23,034 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 21 treesize of output 23 [2019-01-18 17:37:23,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:23,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:23,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,060 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:23,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,128 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-18 17:37:23,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:23,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,171 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-18 17:37:23,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,199 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-18 17:37:23,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:23,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,228 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:23,229 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-18 17:37:23,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,263 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-18 17:37:23,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,297 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-18 17:37:23,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,328 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-18 17:37:23,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:23,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:23,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:23,357 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 72 [2019-01-18 17:37:23,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:23,403 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-18 17:37:23,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:37:23,438 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-18 17:37:23,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:23,562 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-18 17:37:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:23,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:37:23,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:23,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:37:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:37:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:37:23,580 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-18 17:37:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:25,430 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-18 17:37:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:25,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-18 17:37:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:25,431 INFO L225 Difference]: With dead ends: 349 [2019-01-18 17:37:25,431 INFO L226 Difference]: Without dead ends: 344 [2019-01-18 17:37:25,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:37:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-18 17:37:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-18 17:37:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-18 17:37:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-18 17:37:26,409 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-18 17:37:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:26,409 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-18 17:37:26,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:37:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-18 17:37:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:26,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:26,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:26,410 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-18 17:37:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:26,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:26,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:26,531 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-18 17:37:26,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:26,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:26,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:26,532 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 17:37:26,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:26,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:26,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:26,534 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:26,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:26,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:26,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:26,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:26,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:26,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:37:26,609 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 21 treesize of output 23 [2019-01-18 17:37:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:26,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:26,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:26,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,697 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-18 17:37:26,697 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,739 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-18 17:37:26,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,766 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-18 17:37:26,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:26,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,797 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:26,798 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-18 17:37:26,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,825 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-18 17:37:26,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:26,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 17:37:26,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:26,888 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-18 17:37:26,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:26,909 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-18 17:37:26,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:26,947 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-18 17:37:26,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:26,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:37:26,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:26,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:26,968 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-18 17:37:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:28,404 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-18 17:37:28,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:37:28,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:37:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:28,405 INFO L225 Difference]: With dead ends: 257 [2019-01-18 17:37:28,406 INFO L226 Difference]: Without dead ends: 250 [2019-01-18 17:37:28,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-18 17:37:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-18 17:37:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-18 17:37:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-18 17:37:29,427 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-18 17:37:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:29,427 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-18 17:37:29,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-18 17:37:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:29,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:29,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:29,428 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-18 17:37:29,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:29,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:29,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:29,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:29,625 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-18 17:37:29,689 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-18 17:37:29,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:29,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:29,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:29,689 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-18 17:37:29,690 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:29,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:29,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:29,691 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:37:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:29,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:29,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:29,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:29,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:29,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:29,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:29,724 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 18 treesize of output 21 [2019-01-18 17:37:29,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,733 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 21 treesize of output 27 [2019-01-18 17:37:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,736 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 23 treesize of output 37 [2019-01-18 17:37:29,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,742 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 25 treesize of output 51 [2019-01-18 17:37:29,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,750 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:29,751 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,833 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-18 17:37:29,833 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:29,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:37:29,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:29,914 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-18 17:37:29,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:29,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:29,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 36 treesize of output 78 [2019-01-18 17:37:29,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:30,003 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-18 17:37:30,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:30,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:30,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,043 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-18 17:37:30,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:30,094 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-18 17:37:30,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:37:30,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:30,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:30,138 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 106 [2019-01-18 17:37:30,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:30,201 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-18 17:37:30,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:37:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:30,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:30,270 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-18 17:37:30,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:30,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:37:30,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:30,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:37:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:37:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:30,288 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-18 17:37:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:32,195 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-18 17:37:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:32,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:37:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:32,196 INFO L225 Difference]: With dead ends: 316 [2019-01-18 17:37:32,197 INFO L226 Difference]: Without dead ends: 315 [2019-01-18 17:37:32,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:37:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-18 17:37:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-18 17:37:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-18 17:37:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-18 17:37:33,268 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-18 17:37:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:33,269 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-18 17:37:33,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:37:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-18 17:37:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:33,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:33,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:33,269 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-18 17:37:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:33,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:33,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:33,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:33,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:33,386 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-18 17:37:33,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:33,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:33,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:33,387 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-18 17:37:33,388 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:33,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:33,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:33,390 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:33,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:33,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:33,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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:33,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:33,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:33,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:33,452 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 18 treesize of output 21 [2019-01-18 17:37:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,490 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 21 treesize of output 27 [2019-01-18 17:37:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:37:33,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,519 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 25 treesize of output 51 [2019-01-18 17:37:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:33,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,622 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-18 17:37:33,622 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:33,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,840 INFO L303 Elim1Store]: Index analysis took 189 ms [2019-01-18 17:37:33,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:37:33,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:33,887 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-18 17:37:33,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:33,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:33,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:33,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:37:33,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:34,007 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-18 17:37:34,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:34,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:34,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:34,041 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-18 17:37:34,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:34,084 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-18 17:37:34,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:34,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:34,175 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-18 17:37:34,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:34,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:37:34,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:34,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:34,195 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-18 17:37:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:35,641 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-18 17:37:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:37:35,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:37:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:35,642 INFO L225 Difference]: With dead ends: 253 [2019-01-18 17:37:35,642 INFO L226 Difference]: Without dead ends: 246 [2019-01-18 17:37:35,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-18 17:37:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-18 17:37:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-18 17:37:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-18 17:37:36,699 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-18 17:37:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:36,699 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-18 17:37:36,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-18 17:37:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:36,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:36,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:36,700 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-18 17:37:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:36,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:36,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:36,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:37:36,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:36,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:36,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:36,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:36,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:36,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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:36,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:37:36,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:37:36,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:37:36,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:36,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:36,898 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 18 treesize of output 21 [2019-01-18 17:37:36,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,902 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 21 treesize of output 27 [2019-01-18 17:37:36,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:37:36,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,923 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 25 treesize of output 51 [2019-01-18 17:37:36,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:36,933 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:36,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:36,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:36,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:36,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:36,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:37,017 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-18 17:37:37,018 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:37,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,057 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-18 17:37:37,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:37,100 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-18 17:37:37,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:37,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,146 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-18 17:37:37,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:37,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:37:37,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,239 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:37,240 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-18 17:37:37,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:37,287 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-18 17:37:37,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:37:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:37,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:37,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-18 17:37:37,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:37,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:37:37,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:37:37,410 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-18 17:37:37,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:37,486 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-18 17:37:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:37:37,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:37:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:37:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:37:37,506 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-18 17:37:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:39,621 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-18 17:37:39,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:37:39,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-18 17:37:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:39,623 INFO L225 Difference]: With dead ends: 332 [2019-01-18 17:37:39,623 INFO L226 Difference]: Without dead ends: 328 [2019-01-18 17:37:39,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:37:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-18 17:37:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-18 17:37:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-18 17:37:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-18 17:37:40,652 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-18 17:37:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:40,652 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-18 17:37:40,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:37:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-18 17:37:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:40,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:40,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:40,653 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-18 17:37:40,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:40,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:40,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:40,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:40,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:41,416 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-18 17:37:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:37:41,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:41,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:41,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:41,569 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-18 17:37:41,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:41,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:41,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:41,573 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:41,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:41,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:41,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:41,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:41,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:37:41,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,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 21 treesize of output 27 [2019-01-18 17:37:41,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,597 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 23 treesize of output 37 [2019-01-18 17:37:41,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:37:41,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,611 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:41,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,696 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-18 17:37:41,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,731 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-18 17:37:41,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:37:41,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:41,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,812 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:41,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-18 17:37:41,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,857 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-18 17:37:41,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:41,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:41,897 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-18 17:37:41,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:41,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:37:41,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:41,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-18 17:37:41,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:42,006 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-18 17:37:42,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:42,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:37:42,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:42,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:42,025 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-18 17:37:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:43,467 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-18 17:37:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:37:43,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 17:37:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:43,469 INFO L225 Difference]: With dead ends: 242 [2019-01-18 17:37:43,469 INFO L226 Difference]: Without dead ends: 241 [2019-01-18 17:37:43,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-18 17:37:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-18 17:37:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-18 17:37:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-18 17:37:44,558 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-18 17:37:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:44,558 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-18 17:37:44,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-18 17:37:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:44,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:44,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:44,559 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-18 17:37:44,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:44,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:44,675 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-18 17:37:44,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:44,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:44,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:44,675 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 17:37:44,676 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:44,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:44,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:44,678 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:44,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:44,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:44,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:44,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:44,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:44,700 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 18 treesize of output 21 [2019-01-18 17:37:44,704 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 21 treesize of output 23 [2019-01-18 17:37:44,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:44,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:44,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,732 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:44,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,798 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-18 17:37:44,799 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:44,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,841 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-18 17:37:44,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,868 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-18 17:37:44,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:44,896 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:44,896 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 58 [2019-01-18 17:37:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:44,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:37:44,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:45,080 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-18 17:37:45,080 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-18 17:37:45,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:45,113 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-18 17:37:45,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:37:45,135 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-18 17:37:45,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:45,171 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-18 17:37:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:37:45,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:37:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:37:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:37:45,190 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-18 17:37:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:46,715 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-18 17:37:46,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:37:46,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:37:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:46,716 INFO L225 Difference]: With dead ends: 254 [2019-01-18 17:37:46,716 INFO L226 Difference]: Without dead ends: 245 [2019-01-18 17:37:46,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:37:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-18 17:37:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-18 17:37:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-18 17:37:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-18 17:37:47,795 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-18 17:37:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:47,795 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-18 17:37:47,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:37:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-18 17:37:47,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:47,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:47,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:47,796 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-18 17:37:47,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:47,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:47,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:47,908 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-18 17:37:47,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:47,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:47,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:47,908 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-18 17:37:47,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:47,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:47,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:47,911 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:37:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:47,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:47,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:47,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:47,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:47,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:47,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:47,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 18 treesize of output 21 [2019-01-18 17:37:47,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:37:47,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:47,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:47,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:47,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:47,970 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:47,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:47,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,034 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-18 17:37:48,035 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:37:48,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,107 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-18 17:37:48,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:37:48,138 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 58 [2019-01-18 17:37:48,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,164 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-18 17:37:48,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:48,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:48,193 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 69 [2019-01-18 17:37:48,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:48,225 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-18 17:37:48,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:37:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:48,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:48,277 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-18 17:37:48,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:37:48,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:48,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:37:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:37:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:37:48,297 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-18 17:37:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:49,746 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-18 17:37:49,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:37:49,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:37:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:49,748 INFO L225 Difference]: With dead ends: 249 [2019-01-18 17:37:49,748 INFO L226 Difference]: Without dead ends: 248 [2019-01-18 17:37:49,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:37:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-18 17:37:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-18 17:37:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-18 17:37:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-18 17:37:50,867 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-18 17:37:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:50,867 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-18 17:37:50,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:37:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-18 17:37:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:50,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:50,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:50,868 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-18 17:37:50,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:50,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:50,993 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-18 17:37:50,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:50,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:50,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:50,993 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-18 17:37:50,994 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:50,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:50,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:50,995 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:37:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:50,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:50,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:50,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:51,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:51,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:51,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:51,016 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 18 treesize of output 21 [2019-01-18 17:37:51,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,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 21 treesize of output 27 [2019-01-18 17:37:51,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,031 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 23 treesize of output 37 [2019-01-18 17:37:51,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,040 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 25 treesize of output 51 [2019-01-18 17:37:51,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:37:51,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,127 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-18 17:37:51,127 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-18 17:37:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,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, 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-18 17:37:51,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,197 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-18 17:37:51,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:37:51,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:51,228 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-18 17:37:51,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:51,274 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-18 17:37:51,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:37:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:51,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:51,393 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-18 17:37:51,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:51,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:37:51,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:51,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:37:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:37:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:37:51,412 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-18 17:37:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:52,745 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-18 17:37:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:37:52,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-18 17:37:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:52,746 INFO L225 Difference]: With dead ends: 239 [2019-01-18 17:37:52,746 INFO L226 Difference]: Without dead ends: 230 [2019-01-18 17:37:52,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:37:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-18 17:37:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-18 17:37:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-18 17:37:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-18 17:37:53,862 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-18 17:37:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:53,862 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-18 17:37:53,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:37:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-18 17:37:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:37:53,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:53,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:53,863 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-18 17:37:53,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:53,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:53,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:53,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:53,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:53,936 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-18 17:37:53,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:53,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:53,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:37:53,937 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-18 17:37:53,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:53,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:53,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:53,939 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:37:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:53,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:53,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:53,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:53,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:53,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:53,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:53,956 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 18 treesize of output 21 [2019-01-18 17:37:53,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:37:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:53,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:53,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,002 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:54,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,070 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-18 17:37:54,071 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:54,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,125 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-18 17:37:54,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,163 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-18 17:37:54,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:54,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:54,204 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-18 17:37:54,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:54,247 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-18 17:37:54,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:54,278 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-18 17:37:54,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:54,324 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-18 17:37:54,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:54,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:37:54,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:54,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:37:54,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:37:54,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:37:54,343 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-18 17:37:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:55,594 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-18 17:37:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:37:55,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-18 17:37:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:55,596 INFO L225 Difference]: With dead ends: 236 [2019-01-18 17:37:55,596 INFO L226 Difference]: Without dead ends: 227 [2019-01-18 17:37:55,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:37:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-18 17:37:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-18 17:37:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-18 17:37:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-18 17:37:56,719 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-18 17:37:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-18 17:37:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:37:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-18 17:37:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:37:56,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:56,720 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:56,720 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-18 17:37:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:56,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:56,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:56,879 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:37:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:37:56,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:56,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:56,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:37:56,913 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-18 17:37:56,913 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:37:56,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:37:56,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:37:56,915 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:37:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:56,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:37:56,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:56,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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:37:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:56,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:56,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:56,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 18 treesize of output 21 [2019-01-18 17:37:56,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 21 treesize of output 23 [2019-01-18 17:37:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:37:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:37:56,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:56,960 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:37:56,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:56,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:56,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,027 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-18 17:37:57,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:37:57,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,065 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-18 17:37:57,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,090 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-18 17:37:57,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:37:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 57 [2019-01-18 17:37:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,155 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-18 17:37:57,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:37:57,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:37:57,183 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-18 17:37:57,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:57,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-18 17:37:57,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:37:57,234 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-18 17:37:57,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:57,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-18 17:37:57,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:57,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:37:57,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:57,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:37:57,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:37:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:37:57,287 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-18 17:37:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:58,569 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-18 17:37:58,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:37:58,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:37:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:58,571 INFO L225 Difference]: With dead ends: 236 [2019-01-18 17:37:58,571 INFO L226 Difference]: Without dead ends: 227 [2019-01-18 17:37:58,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:37:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-18 17:37:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-18 17:37:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-18 17:37:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-18 17:37:59,660 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-18 17:37:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:59,660 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-18 17:37:59,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:37:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-18 17:37:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:37:59,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:59,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:37:59,661 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-18 17:37:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:59,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:00,234 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-18 17:38:00,345 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-18 17:38:00,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:00,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:00,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:00,346 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:38:00,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:00,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:00,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:00,348 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:38:00,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:00,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:00,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:00,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:00,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:00,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:00,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:00,365 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 18 treesize of output 21 [2019-01-18 17:38:00,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:00,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,377 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 23 treesize of output 37 [2019-01-18 17:38:00,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,451 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 25 treesize of output 51 [2019-01-18 17:38:00,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:00,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,691 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-18 17:38:00,691 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,726 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-18 17:38:00,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,767 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-18 17:38:00,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:00,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:38:00,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,851 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-18 17:38:00,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:00,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,890 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:00,891 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-18 17:38:00,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:00,938 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-18 17:38:00,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:00,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:00,981 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-18 17:38:00,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:01,034 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-18 17:38:01,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:01,061 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-18 17:38:01,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:01,108 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-18 17:38:01,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:01,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:38:01,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:01,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:38:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:38:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:38:01,128 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-18 17:38:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:03,227 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-18 17:38:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:38:03,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:38:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:03,228 INFO L225 Difference]: With dead ends: 326 [2019-01-18 17:38:03,229 INFO L226 Difference]: Without dead ends: 316 [2019-01-18 17:38:03,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:38:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-18 17:38:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-18 17:38:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-18 17:38:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-18 17:38:04,393 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-18 17:38:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:04,393 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-18 17:38:04,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:38:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-18 17:38:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:04,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:04,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:04,394 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:04,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-18 17:38:04,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:04,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:04,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:04,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:04,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:04,591 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-18 17:38:04,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:04,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:04,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:04,592 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-18 17:38:04,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:04,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:04,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:04,594 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:04,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:04,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:04,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:04,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:04,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:04,617 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 18 treesize of output 21 [2019-01-18 17:38:04,622 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 21 treesize of output 23 [2019-01-18 17:38:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:38:04,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:38:04,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,666 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:04,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,742 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-18 17:38:04,742 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:38:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,779 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-18 17:38:04,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,806 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-18 17:38:04,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,832 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:04,832 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-18 17:38:04,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,862 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-18 17:38:04,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:38:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:04,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:38:04,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:04,923 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-18 17:38:04,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:38:04,944 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-18 17:38:04,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:04,969 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-18 17:38:04,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:04,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:38:04,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:38:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:38:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:04,988 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-18 17:38:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:06,905 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-18 17:38:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:06,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:38:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:06,907 INFO L225 Difference]: With dead ends: 288 [2019-01-18 17:38:06,907 INFO L226 Difference]: Without dead ends: 279 [2019-01-18 17:38:06,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-18 17:38:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-18 17:38:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-18 17:38:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-18 17:38:08,516 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-18 17:38:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:08,516 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-18 17:38:08,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:38:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-18 17:38:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:08,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:08,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:08,517 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-18 17:38:08,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:08,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:08,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:08,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:08,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:38:08,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:08,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:08,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:08,641 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-18 17:38:08,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:08,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:08,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:08,643 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:08,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:08,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:08,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:08,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:08,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:08,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:08,660 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 18 treesize of output 21 [2019-01-18 17:38:08,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:08,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:38:08,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:38:08,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,691 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:08,692 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,733 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,758 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-18 17:38:08,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:38:08,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,799 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-18 17:38:08,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,825 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-18 17:38:08,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:38:08,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,887 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-18 17:38:08,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:38:08,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,915 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:08,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:08,917 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 76 [2019-01-18 17:38:08,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:08,951 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-18 17:38:08,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:38:08,973 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-18 17:38:08,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:09,008 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-18 17:38:09,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:09,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:38:09,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:09,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:38:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:38:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:09,027 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-18 17:38:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:10,988 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-18 17:38:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:10,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:38:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:10,990 INFO L225 Difference]: With dead ends: 277 [2019-01-18 17:38:10,990 INFO L226 Difference]: Without dead ends: 268 [2019-01-18 17:38:10,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-18 17:38:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-18 17:38:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-18 17:38:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-18 17:38:12,637 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-18 17:38:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:12,638 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-18 17:38:12,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:38:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-18 17:38:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:12,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:12,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:12,638 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-18 17:38:12,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:12,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:12,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:12,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:12,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:12,831 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-01-18 17:38:12,947 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-18 17:38:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:12,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:12,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:12,948 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-18 17:38:12,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:12,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:12,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:12,950 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:38:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:12,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:12,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:12,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:12,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:12,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:12,969 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 18 treesize of output 21 [2019-01-18 17:38:12,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,972 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 21 treesize of output 27 [2019-01-18 17:38:12,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,979 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 23 treesize of output 37 [2019-01-18 17:38:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,988 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 25 treesize of output 51 [2019-01-18 17:38:12,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:12,998 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:12,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:13,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,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, 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-18 17:38:13,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:13,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:13,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:13,209 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-18 17:38:13,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,256 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-18 17:38:13,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:13,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,298 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-18 17:38:13,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,346 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-18 17:38:13,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:13,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,387 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-18 17:38:13,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,435 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-18 17:38:13,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:38:13,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:13,477 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:13,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 40 treesize of output 96 [2019-01-18 17:38:13,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:13,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-18 17:38:13,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:38:13,548 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-18 17:38:13,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:13,623 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-18 17:38:13,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:38:13,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:13,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:38:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:38:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:13,643 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-18 17:38:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:16,597 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-18 17:38:16,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:38:16,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 17:38:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:16,599 INFO L225 Difference]: With dead ends: 361 [2019-01-18 17:38:16,599 INFO L226 Difference]: Without dead ends: 356 [2019-01-18 17:38:16,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:38:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-18 17:38:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-18 17:38:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-18 17:38:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-18 17:38:18,348 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-18 17:38:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:18,348 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-18 17:38:18,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:38:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-18 17:38:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:18,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:18,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:18,350 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-18 17:38:18,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:18,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:18,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:18,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:38:18,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:18,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:18,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:18,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:18,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:18,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:18,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:18,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:38:18,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:18,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:18,584 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 18 treesize of output 21 [2019-01-18 17:38:18,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,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 21 treesize of output 27 [2019-01-18 17:38:18,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,596 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 23 treesize of output 37 [2019-01-18 17:38:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:18,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:18,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:18,700 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:18,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:18,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:38:18,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:19,235 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-18 17:38:19,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:19,569 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-18 17:38:19,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:19,880 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:19,880 INFO L303 Elim1Store]: Index analysis took 307 ms [2019-01-18 17:38:19,881 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-18 17:38:19,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:20,324 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-18 17:38:20,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,371 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-18 17:38:20,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:20,414 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-18 17:38:20,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,456 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38: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, 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-18 17:38:20,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:20,508 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-18 17:38:20,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:20,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,546 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:20,548 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-18 17:38:20,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:20,599 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-18 17:38:20,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:38:20,625 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-18 17:38:20,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:20,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:20,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:38:20,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:38:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:38:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:20,723 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-18 17:38:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:23,536 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-18 17:38:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:38:23,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 17:38:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:23,538 INFO L225 Difference]: With dead ends: 357 [2019-01-18 17:38:23,538 INFO L226 Difference]: Without dead ends: 352 [2019-01-18 17:38:23,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:38:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-18 17:38:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-18 17:38:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-18 17:38:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-18 17:38:25,057 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-18 17:38:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:25,057 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-18 17:38:25,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:38:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-18 17:38:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:25,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:25,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:25,058 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-18 17:38:25,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:25,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:25,341 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-18 17:38:25,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:25,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:25,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:25,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:25,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:25,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:25,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:25,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:25,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:25,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:25,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:25,390 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 18 treesize of output 21 [2019-01-18 17:38:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,395 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 21 treesize of output 27 [2019-01-18 17:38:25,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38: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 23 treesize of output 37 [2019-01-18 17:38:25,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38: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 25 treesize of output 51 [2019-01-18 17:38:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:25,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,515 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:25,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,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 36 treesize of output 72 [2019-01-18 17:38:25,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,595 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-18 17:38:25,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:25,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:25,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:38:25,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,679 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-18 17:38:25,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:25,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38: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, 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-18 17:38:25,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,768 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-18 17:38:25,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:25,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, 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-18 17:38:25,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,863 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-18 17:38:25,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:25,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:25,909 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:25,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-18 17:38:25,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:25,963 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-18 17:38:25,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:25,992 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-18 17:38:25,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:38:26,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:38:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:38:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:26,097 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-18 17:38:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:28,378 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-18 17:38:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:38:28,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-18 17:38:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:28,380 INFO L225 Difference]: With dead ends: 260 [2019-01-18 17:38:28,380 INFO L226 Difference]: Without dead ends: 253 [2019-01-18 17:38:28,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:38:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-18 17:38:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-18 17:38:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-18 17:38:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-18 17:38:29,434 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-18 17:38:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:29,435 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-18 17:38:29,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:38:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-18 17:38:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:29,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:29,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:29,435 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-18 17:38:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:29,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,596 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-18 17:38:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:29,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:29,597 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:38:29,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:29,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:29,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:29,600 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:38:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:29,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:29,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:29,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:29,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:29,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:29,628 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 18 treesize of output 21 [2019-01-18 17:38:29,630 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 21 treesize of output 23 [2019-01-18 17:38:29,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:38:29,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:38:29,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:29,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,745 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-18 17:38:29,745 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:38:29,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,788 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-18 17:38:29,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,816 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-18 17:38:29,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:29,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,850 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-18 17:38:29,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,880 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-18 17:38:29,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:29,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:29,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:29,917 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-18 17:38:29,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:29,973 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-18 17:38:29,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:38:30,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:30,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:30,052 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-18 17:38:30,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:30,115 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-18 17:38:30,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:38:30,165 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-18 17:38:30,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:30,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:30,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:38:30,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:38:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:38:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:38:30,248 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-18 17:38:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:32,060 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-18 17:38:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:38:32,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:38:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:32,061 INFO L225 Difference]: With dead ends: 202 [2019-01-18 17:38:32,061 INFO L226 Difference]: Without dead ends: 195 [2019-01-18 17:38:32,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:38:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-18 17:38:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-18 17:38:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-18 17:38:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-18 17:38:33,303 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-18 17:38:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:33,303 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-18 17:38:33,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:38:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-18 17:38:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:33,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:33,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:33,304 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-18 17:38:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:33,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:38:33,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:33,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:33,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:33,502 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-18 17:38:33,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:33,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:33,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:33,504 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:38:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:33,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:33,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:33,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:33,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:33,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:33,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:33,523 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 18 treesize of output 21 [2019-01-18 17:38:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,527 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 21 treesize of output 27 [2019-01-18 17:38:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,531 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 23 treesize of output 37 [2019-01-18 17:38:33,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,620 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 25 treesize of output 51 [2019-01-18 17:38:33,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,739 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-18 17:38:33,740 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:33,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,890 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:33,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:38:33,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:33,970 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-18 17:38:33,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:33,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,012 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-18 17:38:34,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,068 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-18 17:38:34,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,109 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:34,110 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-18 17:38:34,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,162 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-18 17:38:34,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:34,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:34,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:34,209 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-18 17:38:34,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:34,258 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-18 17:38:34,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:34,285 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-18 17:38:34,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:34,342 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-18 17:38:34,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:34,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:38:34,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:34,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:38:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:38:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:34,362 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-18 17:38:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:36,285 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-18 17:38:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:36,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:38:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:36,287 INFO L225 Difference]: With dead ends: 199 [2019-01-18 17:38:36,287 INFO L226 Difference]: Without dead ends: 192 [2019-01-18 17:38:36,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:38:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-18 17:38:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-18 17:38:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-18 17:38:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-18 17:38:37,477 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-18 17:38:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:37,477 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-18 17:38:37,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:38:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-18 17:38:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:37,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:37,478 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:37,478 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,478 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-18 17:38:37,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:37,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:37,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:38:37,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:37,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:37,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:37,544 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-18 17:38:37,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:37,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:37,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:37,546 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:37,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:37,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:37,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:37,567 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 18 treesize of output 21 [2019-01-18 17:38:37,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:38:37,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:38:37,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:38:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,602 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:38:37,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,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-18 17:38:37,669 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-18 17:38:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,701 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-18 17:38:37,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,737 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-18 17:38:37,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:37,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,764 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-18 17:38:37,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,798 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-18 17:38:37,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:38:37,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:37,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 17:38:37,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:37,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:37,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:38:37,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-18 17:38:37,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:37,913 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-18 17:38:37,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:37,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 17:38:37,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:37,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:38:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:38:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:38:37,933 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-18 17:38:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:39,566 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-18 17:38:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:38:39,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:38:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:39,567 INFO L225 Difference]: With dead ends: 196 [2019-01-18 17:38:39,567 INFO L226 Difference]: Without dead ends: 187 [2019-01-18 17:38:39,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:38:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-18 17:38:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-18 17:38:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-18 17:38:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-18 17:38:40,971 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-18 17:38:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:40,971 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-18 17:38:40,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:38:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-18 17:38:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:40,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:40,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:40,971 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-18 17:38:40,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:40,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:40,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:40,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:38:41,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:41,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:41,076 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-18 17:38:41,077 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:41,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:41,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:41,078 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:41,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:41,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:41,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:41,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:41,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:41,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:41,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 18 treesize of output 21 [2019-01-18 17:38:41,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,105 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 21 treesize of output 27 [2019-01-18 17:38:41,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,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 23 treesize of output 37 [2019-01-18 17:38:41,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,127 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 25 treesize of output 51 [2019-01-18 17:38:41,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,134 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:41,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,218 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-18 17:38:41,218 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,252 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-18 17:38:41,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,294 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-18 17:38:41,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:41,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:38:41,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,373 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-18 17:38:41,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:41,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:41,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, 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-18 17:38:41,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:41,460 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-18 17:38:41,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-18 17:38:41,498 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-18 17:38:41,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:41,534 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-18 17:38:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-18 17:38:41,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:41,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:41,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:38:41,554 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-18 17:38:42,130 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-18 17:38:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:43,789 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-18 17:38:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:43,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-18 17:38:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:43,791 INFO L225 Difference]: With dead ends: 203 [2019-01-18 17:38:43,791 INFO L226 Difference]: Without dead ends: 194 [2019-01-18 17:38:43,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:38:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-18 17:38:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-18 17:38:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-18 17:38:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-18 17:38:45,262 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-18 17:38:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:45,263 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-18 17:38:45,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:38:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-18 17:38:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:45,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:45,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:45,263 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-18 17:38:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:45,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:45,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:45,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:45,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:45,475 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-18 17:38:45,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:45,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:45,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:45,476 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-18 17:38:45,476 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:45,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:45,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:45,478 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:38:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:45,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:45,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:45,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:45,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:45,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:45,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:38:45,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,512 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 23 treesize of output 37 [2019-01-18 17:38:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,520 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 25 treesize of output 51 [2019-01-18 17:38:45,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,532 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:45,533 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,663 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-18 17:38:45,663 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:45,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-18 17:38:45,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:45,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,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, 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-18 17:38:45,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,862 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-18 17:38:45,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:45,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-18 17:38:45,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:45,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-18 17:38:45,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:45,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:45,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:45,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, 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 96 [2019-01-18 17:38:45,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:46,052 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-18 17:38:46,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:38:46,075 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-18 17:38:46,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:46,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:46,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:38:46,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:46,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:38:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:38:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:46,147 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-18 17:38:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:48,716 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-18 17:38:48,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:38:48,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:38:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:48,718 INFO L225 Difference]: With dead ends: 269 [2019-01-18 17:38:48,718 INFO L226 Difference]: Without dead ends: 265 [2019-01-18 17:38:48,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-18 17:38:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-18 17:38:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-18 17:38:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-18 17:38:50,568 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-18 17:38:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:50,568 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-18 17:38:50,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:38:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-18 17:38:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:50,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:50,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:50,569 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-18 17:38:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:50,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:50,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:50,780 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-18 17:38:50,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:50,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:50,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:50,781 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-18 17:38:50,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:50,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:50,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:50,783 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:38:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:50,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:50,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:50,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:50,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:50,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:50,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:50,799 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 18 treesize of output 21 [2019-01-18 17:38:50,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,802 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 21 treesize of output 27 [2019-01-18 17:38:50,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,807 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 23 treesize of output 37 [2019-01-18 17:38:50,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:38:50,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:50,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,903 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-18 17:38:50,903 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:50,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:50,940 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-18 17:38:50,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:50,984 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-18 17:38:50,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:51,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,032 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-18 17:38:51,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,077 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-18 17:38:51,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:51,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:51,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-18 17:38:51,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,167 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-18 17:38:51,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,207 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:51,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, 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 106 [2019-01-18 17:38:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,256 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-18 17:38:51,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:38:51,279 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-18 17:38:51,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:51,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:38:51,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:51,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:38:51,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:38:51,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:38:51,349 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-18 17:38:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:53,855 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-18 17:38:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:38:53,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:38:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:53,857 INFO L225 Difference]: With dead ends: 253 [2019-01-18 17:38:53,857 INFO L226 Difference]: Without dead ends: 249 [2019-01-18 17:38:53,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:38:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-18 17:38:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-18 17:38:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-18 17:38:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-18 17:38:55,717 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-18 17:38:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:55,717 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-18 17:38:55,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:38:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-18 17:38:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:38:55,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:55,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:38:55,718 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-18 17:38:55,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:55,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:55,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:55,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:55,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:38:55,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:55,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:55,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:38:55,871 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-18 17:38:55,871 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:55,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:55,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:55,873 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:38:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:55,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:55,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:55,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:55,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:55,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:55,891 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 18 treesize of output 21 [2019-01-18 17:38:55,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:38:55,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,901 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 23 treesize of output 37 [2019-01-18 17:38:55,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,909 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 25 treesize of output 51 [2019-01-18 17:38:55,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,917 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:38:55,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:56,000 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-18 17:38:56,000 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:38:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,034 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-18 17:38:56,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:56,079 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-18 17:38:56,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:56,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-18 17:38:56,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:56,163 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-18 17:38:56,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:38:56,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,199 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:38:56,200 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-18 17:38:56,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:56,249 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-18 17:38:56,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-18 17:38:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:56,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:56,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-18 17:38:56,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:56,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:38:56,341 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-18 17:38:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:58,510 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-18 17:38:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:38:58,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-18 17:38:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:58,511 INFO L225 Difference]: With dead ends: 226 [2019-01-18 17:38:58,511 INFO L226 Difference]: Without dead ends: 217 [2019-01-18 17:38:58,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:38:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-18 17:39:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-18 17:39:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-18 17:39:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-18 17:39:00,358 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-18 17:39:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:00,358 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-18 17:39:00,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-18 17:39:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:39:00,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:00,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:00,359 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-18 17:39:00,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:00,580 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:39:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:39:00,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:00,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:00,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:00,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:00,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:00,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:39:00,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:00,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:00,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:00,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:00,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,809 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 23 treesize of output 37 [2019-01-18 17:39:00,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,819 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 25 treesize of output 51 [2019-01-18 17:39:00,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,833 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:00,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,933 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-18 17:39:00,934 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:00,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,973 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-18 17:39:00,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,016 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-18 17:39:01,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:01,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:01,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, 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 79 [2019-01-18 17:39:01,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,096 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-18 17:39:01,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:01,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,139 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 82 [2019-01-18 17:39:01,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,184 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-18 17:39:01,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:01,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,227 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:01,228 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 96 [2019-01-18 17:39:01,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,277 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-18 17:39:01,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:01,307 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-18 17:39:01,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:01,377 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-18 17:39:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:01,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:39:01,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:01,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:39:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:39:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:01,396 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-18 17:39:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:04,009 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-18 17:39:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:04,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:39:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:04,011 INFO L225 Difference]: With dead ends: 258 [2019-01-18 17:39:04,011 INFO L226 Difference]: Without dead ends: 251 [2019-01-18 17:39:04,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:39:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-18 17:39:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-18 17:39:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-18 17:39:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-18 17:39:05,864 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-18 17:39:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:05,864 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-18 17:39:05,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:39:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-18 17:39:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:39:05,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:05,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:05,865 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-18 17:39:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:05,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:05,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:05,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:06,166 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-18 17:39:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:06,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:06,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:06,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:06,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:06,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:06,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:39:06,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:06,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:06,184 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 18 treesize of output 21 [2019-01-18 17:39:06,187 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 21 treesize of output 23 [2019-01-18 17:39:06,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:39:06,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:39:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,211 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:06,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,279 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-18 17:39:06,280 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-18 17:39:06,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,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, 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-18 17:39:06,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,353 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-18 17:39:06,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:39:06,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,384 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:06,385 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 58 [2019-01-18 17:39:06,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,412 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-18 17:39:06,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-18 17:39:06,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,445 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-18 17:39:06,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,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-18 17:39:06,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-18 17:39:06,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:06,508 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:06,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, 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-18 17:39:06,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:06,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-18 17:39:06,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:39:06,564 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-18 17:39:06,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:06,620 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-18 17:39:06,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:39:06,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:39:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:39:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:06,640 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-18 17:39:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:09,523 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-18 17:39:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:09,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:39:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:09,525 INFO L225 Difference]: With dead ends: 279 [2019-01-18 17:39:09,525 INFO L226 Difference]: Without dead ends: 272 [2019-01-18 17:39:09,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:39:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-18 17:39:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-18 17:39:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-18 17:39:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-18 17:39:11,617 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-18 17:39:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:11,617 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-18 17:39:11,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:39:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-18 17:39:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:39:11,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:11,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:11,618 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-18 17:39:11,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:11,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:11,860 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-18 17:39:11,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:11,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:11,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:11,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:11,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:11,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:11,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:11,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:39:11,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:11,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:11,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:11,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,883 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 21 treesize of output 27 [2019-01-18 17:39:11,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,888 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 23 treesize of output 37 [2019-01-18 17:39:11,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-18 17:39:11,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,903 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:11,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,986 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-18 17:39:11,986 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:39:12,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,066 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-18 17:39:12,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:12,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-18 17:39:12,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,147 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-18 17:39:12,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:12,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,187 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-18 17:39:12,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,234 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-18 17:39:12,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:12,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:12,277 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:12,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, 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 106 [2019-01-18 17:39:12,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:12,332 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-18 17:39:12,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:12,360 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-18 17:39:12,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:12,423 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-18 17:39:12,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:12,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:39:12,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:39:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:39:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:39:12,442 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-18 17:39:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:15,176 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-18 17:39:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:15,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:39:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:15,178 INFO L225 Difference]: With dead ends: 256 [2019-01-18 17:39:15,179 INFO L226 Difference]: Without dead ends: 249 [2019-01-18 17:39:15,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:39:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-18 17:39:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-18 17:39:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-18 17:39:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-18 17:39:17,232 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-18 17:39:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:17,233 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-18 17:39:17,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:39:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-18 17:39:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:39:17,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:17,234 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:17,234 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-18 17:39:17,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:17,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:17,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:17,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-18 17:39:17,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:17,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:17,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:17,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:17,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:17,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:17,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:39:17,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:17,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:17,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 18 treesize of output 21 [2019-01-18 17:39:17,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-18 17:39:17,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:39:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-18 17:39:17,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-18 17:39:17,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,486 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-18 17:39:17,486 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-18 17:39:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,521 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-18 17:39:17,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,549 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-18 17:39:17,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:39:17,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,575 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 59 [2019-01-18 17:39:17,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,607 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-18 17:39:17,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:39:17,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:17,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,639 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 72 [2019-01-18 17:39:17,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,673 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-18 17:39:17,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:39:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:17,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-01-18 17:39:17,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:17,741 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-18 17:39:17,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-18 17:39:17,766 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-18 17:39:17,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:17,813 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-18 17:39:17,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 17:39:17,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:17,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:39:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:39:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:39:17,834 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-18 17:39:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:20,298 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-18 17:39:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:39:20,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-18 17:39:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:20,300 INFO L225 Difference]: With dead ends: 234 [2019-01-18 17:39:20,300 INFO L226 Difference]: Without dead ends: 207 [2019-01-18 17:39:20,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:39:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-18 17:39:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-18 17:39:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:39:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-18 17:39:20,761 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-18 17:39:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:20,762 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-18 17:39:20,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:39:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-18 17:39:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:39:20,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:20,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:20,762 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-18 17:39:20,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:20,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:20,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:20,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:20,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:21,002 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-18 17:39:21,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:21,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:21,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-18 17:39:21,003 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-18 17:39:21,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:21,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:21,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:21,005 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 17:39:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:21,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:21,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:21,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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:21,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:21,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:21,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:21,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:21,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,051 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 21 treesize of output 27 [2019-01-18 17:39:21,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,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 23 treesize of output 37 [2019-01-18 17:39:21,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,067 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 25 treesize of output 51 [2019-01-18 17:39:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:21,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,198 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:21,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,264 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-18 17:39:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,318 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-18 17:39:21,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:21,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:21,408 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-18 17:39:21,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,460 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-18 17:39:21,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:21,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,516 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-18 17:39:21,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,562 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-18 17:39:21,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:21,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,607 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:21,608 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 99 [2019-01-18 17:39:21,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,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-18 17:39:21,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:21,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:21,709 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:21,710 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 96 [2019-01-18 17:39:21,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:21,758 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-18 17:39:21,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:21,786 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-18 17:39:21,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:21,881 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-18 17:39:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:21,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-18 17:39:21,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:21,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:39:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:39:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:39:21,900 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-18 17:39:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:23,248 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-18 17:39:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:39:23,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-18 17:39:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:23,249 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:39:23,249 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:39:23,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:39:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:39:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-18 17:39:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:39:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-18 17:39:23,765 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-18 17:39:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:23,765 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-18 17:39:23,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:39:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-18 17:39:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:39:23,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:23,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:23,766 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-18 17:39:23,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:23,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:24,019 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-18 17:39:24,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:24,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:24,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:24,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:24,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:24,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:24,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:24,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:39:24,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:24,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:24,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-18 17:39:24,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,045 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 21 treesize of output 27 [2019-01-18 17:39:24,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,049 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 23 treesize of output 37 [2019-01-18 17:39:24,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,056 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 25 treesize of output 51 [2019-01-18 17:39:24,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:24,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,093 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,146 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:24,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,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 72 [2019-01-18 17:39:24,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,226 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-18 17:39:24,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,266 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-18 17:39:24,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,313 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-18 17:39:24,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,361 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:24,362 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 99 [2019-01-18 17:39:24,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,411 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-18 17:39:24,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:24,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,455 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:24,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, 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 96 [2019-01-18 17:39:24,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,503 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-18 17:39:24,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:24,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:24,548 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:24,549 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 96 [2019-01-18 17:39:24,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:24,597 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-18 17:39:24,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:24,630 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-18 17:39:24,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:24,705 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-18 17:39:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:39:24,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:24,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:39:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:39:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:39:24,724 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-18 17:39:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:26,016 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-18 17:39:26,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:39:26,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 17:39:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:26,017 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:39:26,017 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:39:26,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:39:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:39:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-18 17:39:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:39:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-18 17:39:26,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-18 17:39:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:26,499 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-18 17:39:26,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:39:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-18 17:39:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:39:26,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:26,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:26,499 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:26,499 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-18 17:39:26,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:26,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:26,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:26,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:26,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:26,653 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-01-18 17:39:26,827 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-18 17:39:26,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:26,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:26,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:26,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:26,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:26,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:39:26,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:39:26,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:39:26,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:26,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:26,848 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 18 treesize of output 21 [2019-01-18 17:39:26,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:26,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-18 17:39:26,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,863 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 25 treesize of output 51 [2019-01-18 17:39:26,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,872 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:26,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:26,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:26,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:26,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-18 17:39:26,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,036 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-18 17:39:27,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:27,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,080 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-18 17:39:27,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,127 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-18 17:39:27,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:27,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,169 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:27,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, 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 99 [2019-01-18 17:39:27,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,222 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-18 17:39:27,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:27,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,266 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:27,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, 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 96 [2019-01-18 17:39:27,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,317 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-18 17:39:27,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:27,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:27,358 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:27,359 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 96 [2019-01-18 17:39:27,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:27,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-18 17:39:27,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:27,446 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-18 17:39:27,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:27,518 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-18 17:39:27,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:27,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:39:27,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:27,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:39:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:39:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:39:27,538 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-18 17:39:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:29,334 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-18 17:39:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:39:29,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-18 17:39:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:29,335 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:39:29,335 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:39:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:39:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:39:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-18 17:39:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:39:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-18 17:39:30,120 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-18 17:39:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:30,121 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-18 17:39:30,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:39:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-18 17:39:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:39:30,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:30,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:39:30,121 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-18 17:39:30,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:30,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:30,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:30,360 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-18 17:39:30,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:30,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:30,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:30,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:30,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:30,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:30,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:30,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:30,378 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 18 treesize of output 21 [2019-01-18 17:39:30,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-18 17:39:30,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,386 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 23 treesize of output 37 [2019-01-18 17:39:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,392 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 25 treesize of output 51 [2019-01-18 17:39:30,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-18 17:39:30,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,481 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-18 17:39:30,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-18 17:39:30,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,563 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-18 17:39:30,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-18 17:39:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,604 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:30,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-18 17:39:30,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,647 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-18 17:39:30,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-18 17:39:30,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,735 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-18 17:39:30,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,781 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-18 17:39:30,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:30,825 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 96 [2019-01-18 17:39:30,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,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-18 17:39:30,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:30,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:30,915 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:30,916 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 96 [2019-01-18 17:39:30,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:30,970 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-18 17:39:30,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-18 17:39:31,005 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-18 17:39:31,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:31,086 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-18 17:39:31,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:31,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:39:31,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:31,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:39:31,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:39:31,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:39:31,107 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-18 17:39:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:32,618 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-18 17:39:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:39:32,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-18 17:39:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:32,619 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:39:32,619 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 17:39:32,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:39:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 17:39:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 17:39:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 17:39:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 17:39:32,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-18 17:39:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:32,621 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 17:39:32,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:39:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 17:39:32,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 17:39:32,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 17:39:32,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:32,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:32,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:33,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:33,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:33,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:33,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:33,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:34,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:35,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:36,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:40,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:41,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:42,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:47,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:47,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:47,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:48,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:48,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:53,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:39:57,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:07,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:08,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:08,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:08,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:08,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:08,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:14,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:27,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:35,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:35,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:36,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:36,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:43,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:51,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:51,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:40:55,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:41:01,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:41:40,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:41:53,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:41:53,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:41:53,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:42:13,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:42:13,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:42:13,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:42:17,304 WARN L181 SmtUtils]: Spent 2.74 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-18 17:46:11,659 WARN L181 SmtUtils]: Spent 3.91 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-18 17:46:11,663 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-18 17:46:11,664 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-18 17:46:11,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-18 17:46:11,665 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-18 17:46:11,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-18 17:46:11,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-18 17:46:11,683 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 05:46:11 BoogieIcfgContainer [2019-01-18 17:46:11,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 17:46:11,684 INFO L168 Benchmark]: Toolchain (without parser) took 707098.87 ms. Allocated memory was 133.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 108.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-01-18 17:46:11,685 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 17:46:11,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 105.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-18 17:46:11,685 INFO L168 Benchmark]: Boogie Preprocessor took 28.48 ms. Allocated memory is still 133.2 MB. Free memory was 105.9 MB in the beginning and 104.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:46:11,685 INFO L168 Benchmark]: RCFGBuilder took 370.41 ms. Allocated memory is still 133.2 MB. Free memory was 104.8 MB in the beginning and 93.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:46:11,686 INFO L168 Benchmark]: TraceAbstraction took 706630.57 ms. Allocated memory was 133.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-01-18 17:46:11,687 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 105.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.48 ms. Allocated memory is still 133.2 MB. Free memory was 105.9 MB in the beginning and 104.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.41 ms. Allocated memory is still 133.2 MB. Free memory was 104.8 MB in the beginning and 93.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 706630.57 ms. Allocated memory was 133.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 706.5s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 140.5s AutomataDifference, 0.0s DeadEndRemovalTime, 399.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 60.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 60.3s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 164.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 234.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 99.4s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...