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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:03,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:03,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:03,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:03,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:03,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:03,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:03,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:03,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:03,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:03,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:03,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:03,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:03,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:03,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:03,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:03,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:03,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:03,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:03,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:03,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:03,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:03,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:03,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:03,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:03,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:03,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:03,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:03,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:03,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:03,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:03,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:03,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:03,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:03,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:03,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:03,481 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-02-18 09:38:03,496 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:03,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:03,497 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:03,497 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:03,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:03,497 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:03,498 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:03,500 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:03,500 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:03,500 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:03,500 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:03,501 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:03,501 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:03,501 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:03,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:03,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:03,502 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:03,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:03,504 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:03,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:03,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:03,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:03,505 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:03,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:03,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:03,506 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:03,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:03,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:03,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:03,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:03,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:03,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:03,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:03,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:03,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:03,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:03,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:03,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:03,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:03,509 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:03,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:03,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:03,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:03,565 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:03,565 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:03,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-02-18 09:38:03,566 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-18 09:38:03,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:03,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:03,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:03,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:03,608 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:03,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:03,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:03,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:03,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:03,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... [2019-02-18 09:38:03,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:03,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:03,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:03,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:03,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:04,017 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:04,017 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-18 09:38:04,020 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:04 BoogieIcfgContainer [2019-02-18 09:38:04,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:04,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:04,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:04,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:04,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:03" (1/2) ... [2019-02-18 09:38:04,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c5a5c1 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:04, skipping insertion in model container [2019-02-18 09:38:04,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:04" (2/2) ... [2019-02-18 09:38:04,029 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-18 09:38:04,040 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:04,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-18 09:38:04,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-18 09:38:04,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:04,106 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:04,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:04,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:04,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:04,107 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:04,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:04,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-18 09:38:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:04,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:04,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:04,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-18 09:38:04,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:04,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:04,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:04,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:04,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:04,378 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-18 09:38:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:04,542 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-18 09:38:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:04,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:04,560 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:38:04,560 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 09:38:04,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 09:38:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-18 09:38:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:38:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-18 09:38:04,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-18 09:38:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:04,599 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-18 09:38:04,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-18 09:38:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:04,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:04,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:04,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-18 09:38:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:04,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:04,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:04,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:04,756 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-18 09:38:04,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:04,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:04,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:04,890 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-18 09:38:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:04,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:04,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:04,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:04,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:04,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:04,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:04,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 15 treesize of output 18 [2019-02-18 09:38:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,040 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 18 treesize of output 24 [2019-02-18 09:38:05,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,052 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 20 treesize of output 34 [2019-02-18 09:38:05,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,075 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 22 treesize of output 45 [2019-02-18 09:38:05,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:05,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:05,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:05,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:05,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-02-18 09:38:05,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:05,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:05,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:05,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:05,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:05,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:05,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:05,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:05,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:05,784 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-18 09:38:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:06,158 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-18 09:38:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:06,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:06,162 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:38:06,162 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:38:06,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:38:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-18 09:38:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:38:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-18 09:38:06,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-18 09:38:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:06,168 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-18 09:38:06,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-18 09:38:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:06,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:06,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:06,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-18 09:38:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:06,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:06,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:06,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:06,206 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-18 09:38:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:06,262 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-18 09:38:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:06,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:38:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:06,264 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:38:06,264 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:38:06,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:38:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-18 09:38:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:38:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-18 09:38:06,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-18 09:38:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:06,270 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-18 09:38:06,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-18 09:38:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:06,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:06,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:06,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-18 09:38:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:06,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:06,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:06,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:06,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:06,334 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-18 09:38:06,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:06,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:06,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:06,347 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-18 09:38:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:06,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:06,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:06,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:06,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:06,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:06,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,418 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 18 treesize of output 24 [2019-02-18 09:38:06,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,491 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 20 treesize of output 34 [2019-02-18 09:38:06,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:06,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:06,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:06,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:06,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:06,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:06,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:06,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:06,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:06,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:06,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:06,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:06,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:06,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:06,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:06,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:06,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:06,932 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-18 09:38:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:06,996 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-18 09:38:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:38:06,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:38:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:06,998 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:38:06,998 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:38:06,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:38:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-18 09:38:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:38:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-18 09:38:07,005 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-18 09:38:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:07,006 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-18 09:38:07,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-18 09:38:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:07,007 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:07,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:07,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-18 09:38:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:07,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:07,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:07,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:07,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:07,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:07,114 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-18 09:38:07,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:07,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:07,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:07,123 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 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-02-18 09:38:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:07,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:07,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:07,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:07,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:07,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:07,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,243 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 18 treesize of output 24 [2019-02-18 09:38:07,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:07,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,268 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 22 treesize of output 45 [2019-02-18 09:38:07,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,371 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-02-18 09:38:07,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,413 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-02-18 09:38:07,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:07,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:07,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:07,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:07,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:07,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:07,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:07,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:07,574 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-18 09:38:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:07,756 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-18 09:38:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:07,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:07,759 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:38:07,759 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:38:07,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:38:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-18 09:38:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:38:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-18 09:38:07,766 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-18 09:38:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:07,766 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-18 09:38:07,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-18 09:38:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:07,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:07,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:07,767 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-18 09:38:07,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:07,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:07,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:07,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:07,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:07,832 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-18 09:38:07,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:07,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:07,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:07,845 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:07,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:07,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:07,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:07,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:07,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:07,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:07,877 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 18 treesize of output 20 [2019-02-18 09:38:07,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,889 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 20 treesize of output 26 [2019-02-18 09:38:07,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:07,906 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:07,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,965 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-02-18 09:38:07,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,031 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-02-18 09:38:08,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,054 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-02-18 09:38:08,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:08,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:08,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:08,120 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-18 09:38:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:08,160 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-18 09:38:08,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:08,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:38:08,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:08,162 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:38:08,162 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:38:08,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-18 09:38:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:38:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-18 09:38:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:38:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-18 09:38:08,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-18 09:38:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:08,171 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-18 09:38:08,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-18 09:38:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:08,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:08,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:08,173 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:08,173 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-18 09:38:08,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:08,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:08,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:08,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:08,281 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-18 09:38:08,283 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:08,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:08,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:08,289 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:08,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:08,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:08,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:08,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:08,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:08,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:08,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,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 18 treesize of output 24 [2019-02-18 09:38:08,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,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 20 treesize of output 34 [2019-02-18 09:38:08,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,395 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 22 treesize of output 45 [2019-02-18 09:38:08,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,450 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-02-18 09:38:08,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,492 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-02-18 09:38:08,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,551 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-02-18 09:38:08,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:08,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:08,600 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:08,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, 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-02-18 09:38:08,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:08,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:08,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:08,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:08,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:08,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:08,770 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-18 09:38:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:09,077 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-18 09:38:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:09,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:09,079 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:38:09,079 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 09:38:09,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 09:38:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-18 09:38:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-18 09:38:09,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-18 09:38:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:09,087 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-18 09:38:09,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-18 09:38:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:09,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:09,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:09,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-18 09:38:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:09,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:09,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:09,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:09,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:09,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:09,202 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-18 09:38:09,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:09,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:09,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:09,210 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:09,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:09,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:09,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:09,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:09,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:09,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:09,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,239 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 18 treesize of output 24 [2019-02-18 09:38:09,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,247 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 20 treesize of output 34 [2019-02-18 09:38:09,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,258 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 22 treesize of output 45 [2019-02-18 09:38:09,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,312 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-02-18 09:38:09,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:09,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,519 INFO L303 Elim1Store]: Index analysis took 187 ms [2019-02-18 09:38:09,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:09,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,630 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-02-18 09:38:09,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,665 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-02-18 09:38:09,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:09,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:09,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:09,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:09,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:09,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:09,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:09,857 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-18 09:38:10,092 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-02-18 09:38:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:10,256 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-02-18 09:38:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:10,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:10,258 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:38:10,258 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:38:10,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:38:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-02-18 09:38:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:38:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-02-18 09:38:10,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-02-18 09:38:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-02-18 09:38:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-02-18 09:38:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:10,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:10,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:10,269 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-18 09:38:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:10,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:10,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:10,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:10,407 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-18 09:38:10,409 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:10,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:10,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:10,415 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:10,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:10,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:10,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:10,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:10,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:10,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:10,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:10,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:10,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,460 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 20 treesize of output 34 [2019-02-18 09:38:10,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:10,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,531 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-02-18 09:38:10,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:10,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:10,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,651 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-02-18 09:38:10,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:10,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,684 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-02-18 09:38:10,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,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-02-18 09:38:10,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:10,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:10,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:10,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:10,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:10,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:10,837 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-02-18 09:38:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:11,231 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-02-18 09:38:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:11,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:11,233 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:38:11,233 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:38:11,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:38:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-02-18 09:38:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:38:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-18 09:38:11,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-18 09:38:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:11,242 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-18 09:38:11,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-18 09:38:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:11,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:11,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:11,243 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-18 09:38:11,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:11,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:11,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:11,335 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-18 09:38:11,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:11,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:11,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:11,345 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:11,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:11,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:11,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:11,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:11,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:11,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:11,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,457 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-02-18 09:38:11,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,489 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-02-18 09:38:11,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:11,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:11,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:11,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:11,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:11,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:11,708 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-02-18 09:38:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:11,813 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-02-18 09:38:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:11,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:11,814 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:38:11,814 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:38:11,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:38:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-02-18 09:38:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:38:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-02-18 09:38:11,823 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-02-18 09:38:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:11,823 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-02-18 09:38:11,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-02-18 09:38:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:11,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:11,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:11,824 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-18 09:38:11,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:11,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:11,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:11,919 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-18 09:38:11,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:11,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:11,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:11,927 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:11,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:11,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:11,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,951 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 18 treesize of output 24 [2019-02-18 09:38:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,992 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 20 treesize of output 34 [2019-02-18 09:38:11,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,002 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 22 treesize of output 45 [2019-02-18 09:38:12,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,054 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-02-18 09:38:12,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:12,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,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-02-18 09:38:12,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,109 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-02-18 09:38:12,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:12,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:12,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:12,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:12,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:12,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:12,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:12,233 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-02-18 09:38:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:12,617 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-02-18 09:38:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:12,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:12,619 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:38:12,619 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:38:12,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:38:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-02-18 09:38:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:38:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-02-18 09:38:12,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-02-18 09:38:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:12,632 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-02-18 09:38:12,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-02-18 09:38:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:12,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:12,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:12,633 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-18 09:38:12,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:12,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:12,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:12,743 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-18 09:38:12,745 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:12,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:12,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:12,750 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:12,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:12,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:12,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:12,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,804 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 22 treesize of output 45 [2019-02-18 09:38:12,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,859 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-02-18 09:38:12,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:12,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,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, 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-02-18 09:38:12,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,924 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-02-18 09:38:12,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:12,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,968 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-02-18 09:38:12,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,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-02-18 09:38:13,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:13,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:13,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:13,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:13,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:13,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:13,083 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-02-18 09:38:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:13,470 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-02-18 09:38:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:13,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:13,471 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:13,471 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:38:13,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:38:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-02-18 09:38:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:38:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-18 09:38:13,480 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-18 09:38:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:13,480 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-18 09:38:13,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-18 09:38:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:13,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:13,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:13,481 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-18 09:38:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:13,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:13,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:13,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:13,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:13,537 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-18 09:38:13,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:13,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:13,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:13,543 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 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-02-18 09:38:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:13,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:13,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:13,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:13,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:13,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:13,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-18 09:38:13,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-18 09:38:13,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:13,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,652 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-02-18 09:38:13,652 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,752 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-02-18 09:38:13,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,768 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-02-18 09:38:13,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:13,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:13,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:13,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:13,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:13,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:13,816 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-02-18 09:38:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:13,969 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-02-18 09:38:13,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:13,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:13,970 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:38:13,970 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:38:13,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:38:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-02-18 09:38:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:38:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-18 09:38:13,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-18 09:38:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:13,980 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-18 09:38:13,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-18 09:38:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:13,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:13,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:13,982 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-18 09:38:13,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:13,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:13,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:13,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:13,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:14,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:14,133 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-18 09:38:14,134 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:14,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:14,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:14,139 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:14,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:14,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:14,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:14,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:14,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:14,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,173 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 18 treesize of output 24 [2019-02-18 09:38:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,180 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 20 treesize of output 34 [2019-02-18 09:38:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,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 22 treesize of output 45 [2019-02-18 09:38:14,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,242 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-02-18 09:38:14,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:14,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,269 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-02-18 09:38:14,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,296 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-02-18 09:38:14,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:14,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,323 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-02-18 09:38:14,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:14,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:14,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:14,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:14,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:14,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:14,449 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-02-18 09:38:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:14,691 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-02-18 09:38:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:14,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:14,693 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:38:14,693 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:38:14,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:38:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-02-18 09:38:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:38:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-18 09:38:14,703 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-18 09:38:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:14,703 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-18 09:38:14,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-18 09:38:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:14,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:14,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:14,705 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-18 09:38:14,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:14,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:14,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:14,855 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-18 09:38:14,856 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:14,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:14,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:14,860 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:14,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:14,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:14,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38: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 15 treesize of output 18 [2019-02-18 09:38:14,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,900 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 18 treesize of output 24 [2019-02-18 09:38:14,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:14,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:14,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,963 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-02-18 09:38:14,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,014 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-02-18 09:38:15,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:15,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:15,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:15,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,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-02-18 09:38:15,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,145 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:15,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,147 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-02-18 09:38:15,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:15,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:15,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:15,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:15,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:15,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:15,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:15,278 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-02-18 09:38:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:15,785 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-02-18 09:38:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:15,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:15,786 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:38:15,787 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:38:15,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 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-02-18 09:38:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:38:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-02-18 09:38:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:38:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-18 09:38:15,798 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-18 09:38:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:15,799 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-18 09:38:15,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-18 09:38:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:15,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:15,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:15,800 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-18 09:38:15,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:15,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:15,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:15,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:15,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:15,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-02-18 09:38:15,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:15,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:15,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:15,958 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-18 09:38:15,959 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:15,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:15,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:15,963 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:15,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:15,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:15,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:15,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:15,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:15,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:15,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:15,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:15,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:16,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,017 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 22 treesize of output 45 [2019-02-18 09:38:16,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:16,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,173 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-02-18 09:38:16,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,404 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:16,404 INFO L303 Elim1Store]: Index analysis took 199 ms [2019-02-18 09:38:16,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:16,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,774 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-02-18 09:38:16,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:16,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,909 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-02-18 09:38:16,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:16,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:16,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:17,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:17,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:17,031 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-18 09:38:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:17,559 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-02-18 09:38:17,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:17,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:17,561 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:38:17,561 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:38:17,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:38:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-02-18 09:38:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:38:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-18 09:38:17,572 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-18 09:38:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:17,572 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-18 09:38:17,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-18 09:38:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:17,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:17,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:17,573 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-18 09:38:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:17,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:17,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:17,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:17,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:17,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:17,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:17,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:17,665 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-18 09:38:17,666 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:17,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:17,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:17,671 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:17,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:17,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:17,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:17,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:17,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:17,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:17,724 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 18 treesize of output 20 [2019-02-18 09:38:17,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,728 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 20 treesize of output 26 [2019-02-18 09:38:17,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:17,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,795 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-02-18 09:38:17,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:17,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,826 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-02-18 09:38:17,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,841 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-02-18 09:38:17,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:17,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,864 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-02-18 09:38:17,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,889 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-02-18 09:38:17,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:38:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:17,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:17,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:17,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:17,948 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-02-18 09:38:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:18,175 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-02-18 09:38:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:18,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:18,176 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:38:18,177 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:38:18,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:38:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-02-18 09:38:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:38:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-18 09:38:18,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-18 09:38:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:18,190 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-18 09:38:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-18 09:38:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:18,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:18,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:18,191 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-02-18 09:38:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:18,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:18,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:18,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:18,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:18,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:18,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:18,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:18,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:18,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:18,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:18,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:18,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:18,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 15 treesize of output 18 [2019-02-18 09:38:18,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:18,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,395 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 22 treesize of output 45 [2019-02-18 09:38:18,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,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-02-18 09:38:18,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:18,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:18,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,524 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-02-18 09:38:18,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,577 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-02-18 09:38:18,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,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-02-18 09:38:18,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:18,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,640 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:18,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:18,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:18,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:18,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:18,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:18,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:18,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:18,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:18,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:18,768 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-18 09:38:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:19,132 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-02-18 09:38:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:19,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:19,136 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:38:19,136 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:38:19,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 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-02-18 09:38:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:38:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-02-18 09:38:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:38:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-18 09:38:19,146 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-02-18 09:38:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:19,146 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-18 09:38:19,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-18 09:38:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:19,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:19,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:19,148 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-18 09:38:19,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:38:19,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:19,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:19,201 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-02-18 09:38:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:19,506 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-02-18 09:38:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:19,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:38:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:19,508 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:38:19,508 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:38:19,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:38:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-02-18 09:38:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:38:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-02-18 09:38:19,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-02-18 09:38:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:19,520 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-02-18 09:38:19,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-02-18 09:38:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:19,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:19,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:19,521 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-18 09:38:19,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:19,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:19,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:19,584 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-18 09:38:19,586 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:19,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:19,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:19,589 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:19,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:19,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:19,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:19,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:19,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:19,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:19,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,613 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 18 treesize of output 24 [2019-02-18 09:38:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,617 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 20 treesize of output 34 [2019-02-18 09:38:19,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:19,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,683 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-02-18 09:38:19,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:19,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,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 31 treesize of output 51 [2019-02-18 09:38:19,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:19,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:19,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,777 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-02-18 09:38:19,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:20,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:20,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:20,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:20,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:20,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:20,265 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-02-18 09:38:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:20,462 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-02-18 09:38:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:20,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:20,464 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:38:20,464 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:38:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:38:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-02-18 09:38:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:38:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-02-18 09:38:20,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-02-18 09:38:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:20,475 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-02-18 09:38:20,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-02-18 09:38:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:20,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:20,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:20,476 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-18 09:38:20,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:20,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:20,720 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-18 09:38:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:20,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:20,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:20,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:20,742 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-18 09:38:20,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:20,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:20,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:20,747 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:20,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:20,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:20,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:20,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:20,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:20,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:20,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,784 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 20 treesize of output 34 [2019-02-18 09:38:20,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,795 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 22 treesize of output 45 [2019-02-18 09:38:20,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,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-02-18 09:38:20,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:20,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,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, 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-02-18 09:38:20,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,905 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-02-18 09:38:20,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,953 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:20,954 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-02-18 09:38:20,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:20,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:21,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:21,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:21,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:21,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:21,042 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-02-18 09:38:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:21,365 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-02-18 09:38:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:21,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:21,367 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:38:21,367 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:38:21,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:38:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-02-18 09:38:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:38:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-02-18 09:38:21,380 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-02-18 09:38:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:21,380 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-02-18 09:38:21,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-02-18 09:38:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:21,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:21,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:21,381 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-18 09:38:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:21,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:21,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:21,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:21,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:21,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:21,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:21,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:21,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:21,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:21,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:21,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:38:21,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:21,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:21,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:21,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,612 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 18 treesize of output 24 [2019-02-18 09:38:21,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,617 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 20 treesize of output 34 [2019-02-18 09:38:21,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,622 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 22 treesize of output 45 [2019-02-18 09:38:21,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,668 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-02-18 09:38:21,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:21,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,837 INFO L303 Elim1Store]: Index analysis took 152 ms [2019-02-18 09:38:21,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:21,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:22,211 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-02-18 09:38:22,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:22,422 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-18 09:38:22,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,648 INFO L303 Elim1Store]: Index analysis took 222 ms [2019-02-18 09:38:22,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, 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-02-18 09:38:22,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:22,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:22,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:22,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:22,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:22,882 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-02-18 09:38:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:23,420 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-02-18 09:38:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:23,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:23,423 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:38:23,423 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:38:23,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-02-18 09:38:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:38:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-02-18 09:38:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:38:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-02-18 09:38:23,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-02-18 09:38:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-02-18 09:38:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-02-18 09:38:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:23,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:23,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:23,441 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-02-18 09:38:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:23,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:23,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:23,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:23,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:23,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:23,538 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-02-18 09:38:23,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:23,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:23,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:23,545 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:23,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:23,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:23,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:23,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:23,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:23,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:23,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:23,586 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 18 treesize of output 20 [2019-02-18 09:38:23,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,599 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 20 treesize of output 26 [2019-02-18 09:38:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:23,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,646 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-02-18 09:38:23,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,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, 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-02-18 09:38:23,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,692 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-02-18 09:38:23,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:23,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:38:23,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,760 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-02-18 09:38:23,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:38:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:23,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:23,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:23,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:23,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:23,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:23,813 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-02-18 09:38:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:24,104 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-02-18 09:38:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:24,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:24,105 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:38:24,105 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:38:24,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:38:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-02-18 09:38:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:38:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-02-18 09:38:24,120 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-02-18 09:38:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:24,120 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-02-18 09:38:24,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-02-18 09:38:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:24,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:24,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:24,121 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-02-18 09:38:24,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:24,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:24,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:24,150 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-02-18 09:38:24,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:24,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:24,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:24,155 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:24,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:24,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:24,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:24,243 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 18 treesize of output 20 [2019-02-18 09:38:24,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:38:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,363 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-18 09:38:24,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:24,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-02-18 09:38:24,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,415 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-02-18 09:38:24,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,425 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-02-18 09:38:24,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:38:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:24,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:24,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:24,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:38:24,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:24,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:24,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:24,461 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-02-18 09:38:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:24,731 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-02-18 09:38:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:38:24,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:38:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:24,732 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:38:24,732 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:38:24,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:38:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-02-18 09:38:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:38:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-02-18 09:38:24,754 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-02-18 09:38:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-02-18 09:38:24,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-02-18 09:38:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:24,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:24,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:24,755 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-02-18 09:38:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:24,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:24,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:24,879 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-18 09:38:24,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:24,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:24,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:24,883 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:24,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:24,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:24,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 15 treesize of output 18 [2019-02-18 09:38:24,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,913 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 18 treesize of output 24 [2019-02-18 09:38:24,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,922 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 20 treesize of output 34 [2019-02-18 09:38:24,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,930 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 22 treesize of output 45 [2019-02-18 09:38:24,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,991 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-02-18 09:38:24,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,018 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-02-18 09:38:25,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,046 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-02-18 09:38:25,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,071 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:25,073 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-02-18 09:38:25,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,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-02-18 09:38:25,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:25,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,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, 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-02-18 09:38:25,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,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-02-18 09:38:25,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:25,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:25,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:25,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:25,255 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-02-18 09:38:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:25,700 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-02-18 09:38:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:25,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:25,702 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:38:25,702 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:38:25,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:38:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-02-18 09:38:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:38:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-02-18 09:38:25,722 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-02-18 09:38:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:25,722 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-02-18 09:38:25,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-02-18 09:38:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:25,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:25,722 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:38:25,723 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-02-18 09:38:25,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:25,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:25,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:25,927 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-18 09:38:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:25,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:25,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:25,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:25,934 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-02-18 09:38:25,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:25,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:25,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:25,947 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 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-02-18 09:38:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:25,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:25,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:25,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:25,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:25,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:25,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:25,967 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 18 treesize of output 20 [2019-02-18 09:38:25,972 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 20 treesize of output 22 [2019-02-18 09:38:26,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,130 INFO L303 Elim1Store]: Index analysis took 156 ms [2019-02-18 09:38:26,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-18 09:38:26,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,253 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-02-18 09:38:26,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-18 09:38:26,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,360 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-02-18 09:38:26,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:38:26,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,648 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 27 [2019-02-18 09:38:26,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,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-02-18 09:38:26,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-02-18 09:38:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:26,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:26,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:26,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:38:26,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:26,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:38:26,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:38:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:26,757 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-02-18 09:38:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:26,908 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-02-18 09:38:26,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:26,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-18 09:38:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:26,910 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:38:26,910 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:38:26,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:38:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-02-18 09:38:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:38:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-18 09:38:26,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-18 09:38:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:26,933 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-18 09:38:26,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:38:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-18 09:38:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:26,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:26,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:26,934 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-18 09:38:26,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:27,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:27,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:27,075 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-18 09:38:27,076 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:27,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:27,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:27,080 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:27,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:27,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:27,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:27,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:27,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 15 treesize of output 18 [2019-02-18 09:38:27,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,102 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 18 treesize of output 24 [2019-02-18 09:38:27,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,110 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 20 treesize of output 34 [2019-02-18 09:38:27,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,116 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 22 treesize of output 45 [2019-02-18 09:38:27,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,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-02-18 09:38:27,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,256 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-02-18 09:38:27,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,283 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-02-18 09:38:27,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:27,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,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, 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-02-18 09:38:27,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:27,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:27,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-02-18 09:38:27,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:27,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:27,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:27,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:27,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:27,405 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-02-18 09:38:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:27,629 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-02-18 09:38:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:27,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:27,631 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:38:27,631 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:38:27,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:38:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-02-18 09:38:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:38:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-18 09:38:27,649 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-18 09:38:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:27,649 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-18 09:38:27,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-18 09:38:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:27,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:27,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:27,650 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-18 09:38:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:27,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,839 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:38:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:27,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:27,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:27,887 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-18 09:38:27,888 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:27,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:27,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:27,892 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:27,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:27,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:27,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:27,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:27,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,914 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 18 treesize of output 24 [2019-02-18 09:38:27,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,918 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 20 treesize of output 34 [2019-02-18 09:38:27,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,925 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 22 treesize of output 45 [2019-02-18 09:38:27,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,973 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-02-18 09:38:27,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:27,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:28,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,029 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-02-18 09:38:28,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:28,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,077 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-02-18 09:38:28,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:28,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:28,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,133 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:28,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,135 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-02-18 09:38:28,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:28,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:28,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:28,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:28,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:28,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:28,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:28,272 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-18 09:38:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:28,642 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-02-18 09:38:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:28,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:28,644 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:38:28,644 INFO L226 Difference]: Without dead ends: 96 [2019-02-18 09:38:28,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-18 09:38:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-02-18 09:38:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:38:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-18 09:38:28,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-18 09:38:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:28,663 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-18 09:38:28,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-18 09:38:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:28,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:28,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:28,664 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-18 09:38:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:28,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:28,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:28,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:28,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:28,849 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-18 09:38:28,850 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:28,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:28,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:28,854 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:28,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:28,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:28,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:28,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:28,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:28,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:28,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,879 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 18 treesize of output 24 [2019-02-18 09:38:28,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:28,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:28,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:28,971 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-02-18 09:38:28,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,997 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-02-18 09:38:28,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:29,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,040 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-02-18 09:38:29,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,071 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-02-18 09:38:29,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:29,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,103 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:29,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, 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-02-18 09:38:29,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:29,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:29,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:29,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:29,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:29,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:29,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:29,223 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-18 09:38:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:29,600 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-02-18 09:38:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:29,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:29,602 INFO L225 Difference]: With dead ends: 102 [2019-02-18 09:38:29,602 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:38:29,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:38:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-02-18 09:38:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:38:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-02-18 09:38:29,631 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-02-18 09:38:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:29,631 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-02-18 09:38:29,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-02-18 09:38:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:29,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:29,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:29,632 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-02-18 09:38:29,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:29,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:29,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,833 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:38:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:29,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:29,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:29,876 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-02-18 09:38:29,877 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:29,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:29,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:29,881 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:29,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:29,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:29,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:29,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 15 treesize of output 18 [2019-02-18 09:38:29,905 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 18 treesize of output 20 [2019-02-18 09:38:29,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-02-18 09:38:29,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,933 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:29,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:29,979 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-02-18 09:38:29,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:30,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,012 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-02-18 09:38:30,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,028 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-02-18 09:38:30,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:30,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,051 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:30,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-18 09:38:30,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,069 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-02-18 09:38:30,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-02-18 09:38:30,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,094 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 30 treesize of output 44 [2019-02-18 09:38:30,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,112 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-02-18 09:38:30,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-18 09:38:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:30,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:30,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:30,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:30,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:30,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:30,207 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-02-18 09:38:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,626 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-02-18 09:38:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:30,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,628 INFO L225 Difference]: With dead ends: 108 [2019-02-18 09:38:30,628 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:38:30,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 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-02-18 09:38:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:38:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-02-18 09:38:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:38:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-02-18 09:38:30,650 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-02-18 09:38:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,650 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-02-18 09:38:30,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-02-18 09:38:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:30,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:30,651 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-02-18 09:38:30,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:30,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:30,797 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-18 09:38:30,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:30,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:30,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:30,800 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:30,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:30,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:30,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:30,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,822 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 18 treesize of output 24 [2019-02-18 09:38:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,829 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 20 treesize of output 34 [2019-02-18 09:38:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,840 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 22 treesize of output 45 [2019-02-18 09:38:30,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:30,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,923 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-02-18 09:38:30,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,948 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-02-18 09:38:30,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:30,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,976 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:30,977 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-02-18 09:38:30,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,008 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-02-18 09:38:31,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:31,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:31,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:31,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:31,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,171 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:31,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:31,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,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-02-18 09:38:31,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:31,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:31,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:31,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:31,353 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-02-18 09:38:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:32,756 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-02-18 09:38:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:32,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:32,759 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:38:32,759 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:38:32,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:38:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-02-18 09:38:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-18 09:38:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-02-18 09:38:32,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-02-18 09:38:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:32,785 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-02-18 09:38:32,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-02-18 09:38:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:32,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:32,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:32,786 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-02-18 09:38:32,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:32,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,399 WARN L181 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-18 09:38:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:33,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:33,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:33,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:33,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:33,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:33,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:33,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:33,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:33,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,505 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 18 treesize of output 24 [2019-02-18 09:38:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,510 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 20 treesize of output 34 [2019-02-18 09:38:33,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,516 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 22 treesize of output 45 [2019-02-18 09:38:33,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:33,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,591 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-02-18 09:38:33,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,617 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-02-18 09:38:33,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,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, 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-02-18 09:38:33,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,681 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-02-18 09:38:33,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,718 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:33,719 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 73 [2019-02-18 09:38:33,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,751 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-02-18 09:38:33,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:33,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,781 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:33,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,783 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-02-18 09:38:33,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:33,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:33,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:33,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:38:33,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:33,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:33,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:33,910 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-02-18 09:38:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:34,479 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-02-18 09:38:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:34,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:34,482 INFO L225 Difference]: With dead ends: 146 [2019-02-18 09:38:34,482 INFO L226 Difference]: Without dead ends: 145 [2019-02-18 09:38:34,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:38:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-18 09:38:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-02-18 09:38:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:38:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-02-18 09:38:34,506 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-02-18 09:38:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:34,506 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-02-18 09:38:34,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-02-18 09:38:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:34,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:34,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:34,508 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-18 09:38:34,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:34,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:34,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:34,586 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-18 09:38:34,587 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:34,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:34,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:34,589 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:34,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:34,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:34,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:34,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:34,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:34,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:34,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:34,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:34,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:34,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,679 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-02-18 09:38:34,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:34,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:34,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,735 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-02-18 09:38:34,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:34,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:34,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,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-02-18 09:38:34,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:34,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:34,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:38:34,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:34,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:38:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:38:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:34,859 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-02-18 09:38:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:35,092 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-02-18 09:38:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:35,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-18 09:38:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:35,094 INFO L225 Difference]: With dead ends: 111 [2019-02-18 09:38:35,095 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:38:35,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:38:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-02-18 09:38:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 09:38:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-02-18 09:38:35,119 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-02-18 09:38:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-02-18 09:38:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:38:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-02-18 09:38:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:35,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:35,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:35,120 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-18 09:38:35,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:35,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,275 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-18 09:38:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:35,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:35,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:35,317 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-18 09:38:35,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:35,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:35,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:35,324 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:35,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:35,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:35,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:35,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:35,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,359 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 22 treesize of output 45 [2019-02-18 09:38:35,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,444 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-02-18 09:38:35,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:35,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,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-02-18 09:38:35,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,556 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:35,558 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-02-18 09:38:35,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:35,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,614 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-02-18 09:38:35,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:35,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:35,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:35,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:35,754 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-02-18 09:38:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:36,153 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-02-18 09:38:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:36,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:36,156 INFO L225 Difference]: With dead ends: 153 [2019-02-18 09:38:36,156 INFO L226 Difference]: Without dead ends: 152 [2019-02-18 09:38:36,156 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-02-18 09:38:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-18 09:38:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-02-18 09:38:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-18 09:38:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-02-18 09:38:36,187 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-02-18 09:38:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:36,187 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-02-18 09:38:36,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-02-18 09:38:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:36,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:36,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:36,188 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-18 09:38:36,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,365 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-18 09:38:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:36,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:36,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:36,389 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-18 09:38:36,391 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:36,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:36,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:36,393 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:36,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:36,417 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 18 treesize of output 20 [2019-02-18 09:38:36,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,462 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 20 treesize of output 26 [2019-02-18 09:38:36,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,471 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:36,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,507 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-02-18 09:38:36,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:36,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,537 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-02-18 09:38:36,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,553 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-02-18 09:38:36,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,576 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:36,577 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 28 treesize of output 41 [2019-02-18 09:38:36,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,609 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-02-18 09:38:36,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:38:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:36,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:36,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:36,724 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-02-18 09:38:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:36,953 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-02-18 09:38:36,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:36,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:36,956 INFO L225 Difference]: With dead ends: 143 [2019-02-18 09:38:36,956 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:38:36,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:38:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-02-18 09:38:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-18 09:38:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-02-18 09:38:36,984 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-02-18 09:38:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:36,984 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-02-18 09:38:36,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-02-18 09:38:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:36,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:36,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:36,985 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-18 09:38:36,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:37,287 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-02-18 09:38:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:37,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:37,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:37,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:37,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:37,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:37,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:37,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:37,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:37,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,423 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-02-18 09:38:37,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,450 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-02-18 09:38:37,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,476 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-02-18 09:38:37,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,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, 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-02-18 09:38:37,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,535 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-02-18 09:38:37,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:37,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,568 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:37,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:37,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:37,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:37,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:37,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:37,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:37,707 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-02-18 09:38:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,114 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-02-18 09:38:38,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:38,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,116 INFO L225 Difference]: With dead ends: 196 [2019-02-18 09:38:38,116 INFO L226 Difference]: Without dead ends: 195 [2019-02-18 09:38:38,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-18 09:38:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-02-18 09:38:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:38:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-02-18 09:38:38,158 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-02-18 09:38:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,158 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-02-18 09:38:38,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-02-18 09:38:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:38,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:38,159 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,159 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-02-18 09:38:38,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,369 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-18 09:38:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:38,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:38,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:38,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:38,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:38,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:38,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,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 18 treesize of output 24 [2019-02-18 09:38:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:38,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,494 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 22 treesize of output 45 [2019-02-18 09:38:38,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:38,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,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, 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-02-18 09:38:38,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,611 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-02-18 09:38:38,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:38,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,671 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-02-18 09:38:38,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:38,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,700 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:38,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, 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-02-18 09:38:38,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,735 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-02-18 09:38:38,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:38,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,768 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:38,769 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-02-18 09:38:38,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:38,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:38,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:38,884 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-02-18 09:38:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:39,376 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-02-18 09:38:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:39,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:39,379 INFO L225 Difference]: With dead ends: 205 [2019-02-18 09:38:39,379 INFO L226 Difference]: Without dead ends: 197 [2019-02-18 09:38:39,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-18 09:38:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-02-18 09:38:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:38:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-18 09:38:39,415 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-18 09:38:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:39,416 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-18 09:38:39,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-18 09:38:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:39,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:39,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:39,417 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-18 09:38:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:39,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:39,496 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-18 09:38:39,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:39,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:39,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:39,500 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:39,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:39,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:39,523 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 18 treesize of output 20 [2019-02-18 09:38:39,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:38:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,544 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-18 09:38:39,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,579 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-02-18 09:38:39,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-18 09:38:39,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 09:38:39,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:38:39,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,626 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-02-18 09:38:39,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,636 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-02-18 09:38:39,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:38:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:39,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:39,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:39,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:39,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:39,687 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-18 09:38:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:39,866 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-02-18 09:38:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:39,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:39,868 INFO L225 Difference]: With dead ends: 165 [2019-02-18 09:38:39,868 INFO L226 Difference]: Without dead ends: 164 [2019-02-18 09:38:39,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-18 09:38:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-02-18 09:38:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:38:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-18 09:38:39,906 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-18 09:38:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:39,906 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-18 09:38:39,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-18 09:38:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:39,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:39,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:39,907 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-02-18 09:38:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:39,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,158 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-02-18 09:38:40,430 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-02-18 09:38:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:40,440 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-02-18 09:38:40,441 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:40,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:40,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:40,443 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:40,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:40,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:40,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 18 treesize of output 20 [2019-02-18 09:38:40,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,478 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 20 treesize of output 26 [2019-02-18 09:38:40,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:40,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,525 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-02-18 09:38:40,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:40,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,553 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-02-18 09:38:40,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,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-02-18 09:38:40,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:40,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,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, 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 48 [2019-02-18 09:38:40,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,611 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-02-18 09:38:40,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:40,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:40,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:40,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:40,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:40,663 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-18 09:38:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:40,896 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-02-18 09:38:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:40,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:40,897 INFO L225 Difference]: With dead ends: 174 [2019-02-18 09:38:40,898 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:38:40,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:38:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-02-18 09:38:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-18 09:38:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-02-18 09:38:40,941 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-02-18 09:38:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:40,941 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-02-18 09:38:40,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-02-18 09:38:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:40,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:40,942 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 09:38:40,942 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:40,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-02-18 09:38:40,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:40,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:40,989 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-02-18 09:38:40,989 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:40,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:40,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:40,993 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 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-02-18 09:38:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:40,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:41,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:41,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:41,019 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 18 treesize of output 20 [2019-02-18 09:38:41,028 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 20 treesize of output 22 [2019-02-18 09:38:41,047 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-18 09:38:41,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,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-02-18 09:38:41,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-02-18 09:38:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 09:38:41,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 09:38:41,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,092 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 18 treesize of output 5 [2019-02-18 09:38:41,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-18 09:38:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-02-18 09:38:41,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:41,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:38:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:38:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:41,132 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-02-18 09:38:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:41,299 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-02-18 09:38:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:41,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-18 09:38:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:41,303 INFO L225 Difference]: With dead ends: 357 [2019-02-18 09:38:41,303 INFO L226 Difference]: Without dead ends: 353 [2019-02-18 09:38:41,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-02-18 09:38:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-02-18 09:38:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-18 09:38:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-02-18 09:38:41,438 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-02-18 09:38:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:41,439 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-02-18 09:38:41,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:38:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-02-18 09:38:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:41,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:41,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:41,441 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-02-18 09:38:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:41,663 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-18 09:38:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:41,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:41,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:41,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:41,689 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-18 09:38:41,690 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:41,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:41,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:41,693 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:41,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:41,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:41,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:41,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,749 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 18 treesize of output 24 [2019-02-18 09:38:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,784 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 20 treesize of output 34 [2019-02-18 09:38:41,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,875 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 22 treesize of output 45 [2019-02-18 09:38:41,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:41,960 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-02-18 09:38:41,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:41,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:42,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,036 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-02-18 09:38:42,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:42,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:42,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,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-02-18 09:38:42,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:42,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:42,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:42,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:42,166 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-02-18 09:38:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:42,453 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-02-18 09:38:42,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:42,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:38:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:42,457 INFO L225 Difference]: With dead ends: 348 [2019-02-18 09:38:42,457 INFO L226 Difference]: Without dead ends: 338 [2019-02-18 09:38:42,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-18 09:38:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-02-18 09:38:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-18 09:38:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-02-18 09:38:42,558 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-02-18 09:38:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:42,558 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-02-18 09:38:42,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-02-18 09:38:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:42,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:42,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:42,559 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-18 09:38:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:42,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:42,706 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-18 09:38:42,706 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:42,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:42,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:42,709 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:42,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:42,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:42,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,732 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 18 treesize of output 24 [2019-02-18 09:38:42,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,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 20 treesize of output 34 [2019-02-18 09:38:42,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,746 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 22 treesize of output 45 [2019-02-18 09:38:42,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:42,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,822 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-02-18 09:38:42,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,847 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-02-18 09:38:42,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:42,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,880 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-02-18 09:38:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,910 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-02-18 09:38:42,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:42,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,942 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:42,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:38:42,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,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-02-18 09:38:42,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:43,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:43,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:43,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:43,057 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-02-18 09:38:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:43,472 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-02-18 09:38:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:43,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:43,475 INFO L225 Difference]: With dead ends: 348 [2019-02-18 09:38:43,476 INFO L226 Difference]: Without dead ends: 343 [2019-02-18 09:38:43,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-18 09:38:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-02-18 09:38:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-02-18 09:38:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-02-18 09:38:43,594 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-02-18 09:38:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,594 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-02-18 09:38:43,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-02-18 09:38:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:43,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:43,596 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-18 09:38:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:43,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:43,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:43,793 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-18 09:38:43,794 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:43,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:43,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:43,797 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:43,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:43,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:43,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:43,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:43,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:43,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:44,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:44,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,142 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-02-18 09:38:44,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,174 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-02-18 09:38:44,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,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-02-18 09:38:44,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:44,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,255 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:44,256 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-02-18 09:38:44,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:44,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,322 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-02-18 09:38:44,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:44,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:44,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:44,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:44,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:44,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:44,440 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-02-18 09:38:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:45,045 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-02-18 09:38:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:45,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:38:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:45,051 INFO L225 Difference]: With dead ends: 457 [2019-02-18 09:38:45,051 INFO L226 Difference]: Without dead ends: 456 [2019-02-18 09:38:45,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:38:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-02-18 09:38:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-02-18 09:38:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-18 09:38:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-02-18 09:38:45,160 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-02-18 09:38:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-02-18 09:38:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-02-18 09:38:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:45,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:45,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:45,161 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-18 09:38:45,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:45,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:45,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:45,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:45,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:45,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:45,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:45,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:45,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:45,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:45,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:45,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,366 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 18 treesize of output 24 [2019-02-18 09:38:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:45,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,386 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 22 treesize of output 45 [2019-02-18 09:38:45,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:45,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:45,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,484 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-02-18 09:38:45,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,516 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:45,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, 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-02-18 09:38:45,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,547 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-02-18 09:38:45,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:45,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,578 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-02-18 09:38:45,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,609 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-02-18 09:38:45,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:45,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,643 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:45,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, 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-02-18 09:38:45,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:45,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:45,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:45,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:45,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:45,767 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-02-18 09:38:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:46,288 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-02-18 09:38:46,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:46,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:38:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:46,292 INFO L225 Difference]: With dead ends: 346 [2019-02-18 09:38:46,292 INFO L226 Difference]: Without dead ends: 345 [2019-02-18 09:38:46,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-02-18 09:38:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-02-18 09:38:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:38:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-02-18 09:38:46,352 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-02-18 09:38:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:46,352 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-02-18 09:38:46,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-02-18 09:38:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:46,353 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:46,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:46,353 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-02-18 09:38:46,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:46,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:46,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:46,475 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:46,475 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-18 09:38:46,476 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:46,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:46,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:46,479 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:46,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:46,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:46,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:46,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-18 09:38:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,507 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 20 treesize of output 26 [2019-02-18 09:38:46,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:46,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,558 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-02-18 09:38:46,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:46,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,600 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-02-18 09:38:46,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:46,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,618 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:46,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-18 09:38:46,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,637 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-02-18 09:38:46,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-02-18 09:38:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,662 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 30 treesize of output 44 [2019-02-18 09:38:46,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,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-02-18 09:38:46,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-18 09:38:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:46,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:46,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:46,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:46,747 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-02-18 09:38:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:47,198 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-02-18 09:38:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:47,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:47,201 INFO L225 Difference]: With dead ends: 280 [2019-02-18 09:38:47,201 INFO L226 Difference]: Without dead ends: 277 [2019-02-18 09:38:47,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 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-02-18 09:38:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-02-18 09:38:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-02-18 09:38:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-18 09:38:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-02-18 09:38:47,293 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-02-18 09:38:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-02-18 09:38:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-02-18 09:38:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:47,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:47,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:47,295 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-02-18 09:38:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:47,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:47,411 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-02-18 09:38:47,413 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:47,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:47,415 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:47,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:47,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:47,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:47,436 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 18 treesize of output 20 [2019-02-18 09:38:47,449 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 20 treesize of output 22 [2019-02-18 09:38:47,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-02-18 09:38:47,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,491 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-02-18 09:38:47,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-18 09:38:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,513 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-02-18 09:38:47,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:38:47,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,535 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-02-18 09:38:47,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,545 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-02-18 09:38:47,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-18 09:38:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 09:38:47,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:47,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:47,594 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-02-18 09:38:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:47,922 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-02-18 09:38:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:47,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 09:38:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:47,925 INFO L225 Difference]: With dead ends: 390 [2019-02-18 09:38:47,925 INFO L226 Difference]: Without dead ends: 377 [2019-02-18 09:38:47,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-02-18 09:38:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-02-18 09:38:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-02-18 09:38:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-18 09:38:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-02-18 09:38:48,075 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-02-18 09:38:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:48,075 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-02-18 09:38:48,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-02-18 09:38:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:48,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:48,077 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 09:38:48,077 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-02-18 09:38:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,248 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-02-18 09:38:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:48,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:48,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:48,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:48,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:48,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:48,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:48,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,363 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 18 treesize of output 24 [2019-02-18 09:38:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,367 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 20 treesize of output 34 [2019-02-18 09:38:48,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:48,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:48,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,452 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-02-18 09:38:48,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,513 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-02-18 09:38:48,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,545 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-02-18 09:38:48,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:48,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,578 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:48,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 73 [2019-02-18 09:38:48,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,612 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-02-18 09:38:48,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,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, 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-02-18 09:38:48,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,684 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-02-18 09:38:48,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-02-18 09:38:48,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,719 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 79 [2019-02-18 09:38:48,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:48,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-18 09:38:48,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:48,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:38:48,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:38:48,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:48,871 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-02-18 09:38:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:49,498 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-02-18 09:38:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:49,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-18 09:38:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:49,503 INFO L225 Difference]: With dead ends: 375 [2019-02-18 09:38:49,503 INFO L226 Difference]: Without dead ends: 374 [2019-02-18 09:38:49,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:38:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-18 09:38:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-02-18 09:38:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-18 09:38:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-02-18 09:38:49,617 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-02-18 09:38:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:49,617 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-02-18 09:38:49,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:38:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-02-18 09:38:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:49,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:49,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:49,619 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:49,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-02-18 09:38:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:49,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:49,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:49,784 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-18 09:38:49,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:49,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:49,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:49,787 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:49,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:49,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:49,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:49,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:49,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:49,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:49,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,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 18 treesize of output 24 [2019-02-18 09:38:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:49,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,902 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 22 treesize of output 45 [2019-02-18 09:38:49,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,949 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-02-18 09:38:49,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:49,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:49,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:49,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:50,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:50,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,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-02-18 09:38:50,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:38:50,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:50,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:38:50,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:38:50,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:50,116 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-02-18 09:38:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:50,396 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-02-18 09:38:50,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:50,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:38:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:50,398 INFO L225 Difference]: With dead ends: 157 [2019-02-18 09:38:50,398 INFO L226 Difference]: Without dead ends: 150 [2019-02-18 09:38:50,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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-02-18 09:38:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-18 09:38:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-18 09:38:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:38:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-02-18 09:38:50,520 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-02-18 09:38:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:50,520 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-02-18 09:38:50,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:38:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-02-18 09:38:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:50,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:50,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:50,521 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-18 09:38:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:50,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:50,678 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:50,678 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-18 09:38:50,679 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:50,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:50,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:50,682 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 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-02-18 09:38:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:50,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:50,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:50,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:50,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,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 18 treesize of output 24 [2019-02-18 09:38:50,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,715 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 20 treesize of output 34 [2019-02-18 09:38:50,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,722 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 22 treesize of output 45 [2019-02-18 09:38:50,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,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-02-18 09:38:50,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,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 51 [2019-02-18 09:38:50,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,826 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-02-18 09:38:50,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:50,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,854 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:50,855 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-02-18 09:38:50,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,886 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-02-18 09:38:50,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:50,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:51,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:51,049 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-02-18 09:38:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:51,544 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-02-18 09:38:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:51,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:51,546 INFO L225 Difference]: With dead ends: 206 [2019-02-18 09:38:51,546 INFO L226 Difference]: Without dead ends: 199 [2019-02-18 09:38:51,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 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-02-18 09:38:51,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-18 09:38:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-02-18 09:38:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-18 09:38:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-02-18 09:38:51,721 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-02-18 09:38:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:51,722 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-02-18 09:38:51,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-02-18 09:38:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:51,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:51,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:51,723 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-18 09:38:51,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:51,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:51,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:51,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:51,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:51,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:51,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:51,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:51,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:51,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:51,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:51,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:51,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:51,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:51,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:51,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,904 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 20 treesize of output 26 [2019-02-18 09:38:51,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:51,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,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-02-18 09:38:51,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-18 09:38:52,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,011 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-02-18 09:38:52,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,033 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-02-18 09:38:52,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:52,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 09:38:52,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,095 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-02-18 09:38:52,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-18 09:38:52,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,136 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-18 09:38:52,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,165 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-02-18 09:38:52,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:38:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:52,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:52,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:52,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:52,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:52,279 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-02-18 09:38:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:52,759 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-02-18 09:38:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:52,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:52,761 INFO L225 Difference]: With dead ends: 161 [2019-02-18 09:38:52,762 INFO L226 Difference]: Without dead ends: 156 [2019-02-18 09:38:52,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-18 09:38:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-02-18 09:38:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:38:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-02-18 09:38:52,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-02-18 09:38:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:52,823 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-02-18 09:38:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-02-18 09:38:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:38:52,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:52,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:52,824 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,824 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-02-18 09:38:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:52,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:38:52,988 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-18 09:38:52,989 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,991 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-18 09:38:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:53,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:53,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:53,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:53,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:53,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,017 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 18 treesize of output 24 [2019-02-18 09:38:53,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,023 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 20 treesize of output 34 [2019-02-18 09:38:53,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,029 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 22 treesize of output 45 [2019-02-18 09:38:53,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,077 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-02-18 09:38:53,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:53,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:53,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,134 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-02-18 09:38:53,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,163 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-02-18 09:38:53,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,192 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-02-18 09:38:53,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,224 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:53,224 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-02-18 09:38:53,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:53,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:53,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:53,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:53,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:53,331 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-02-18 09:38:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:53,692 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-02-18 09:38:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:53,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 09:38:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:53,694 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:38:53,694 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:38:53,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:38:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-18 09:38:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:38:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-18 09:38:53,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-18 09:38:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-18 09:38:53,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-18 09:38:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:38:53,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:53,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:53,795 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-02-18 09:38:53,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:53,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:53,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:38:53,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:53,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:53,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:38:53,946 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-02-18 09:38:53,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:53,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:53,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:53,950 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-18 09:38:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:53,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:53,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:53,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:53,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:53,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:53,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:53,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,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 18 treesize of output 24 [2019-02-18 09:38:53,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,982 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 20 treesize of output 34 [2019-02-18 09:38:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:53,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:54,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,073 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-02-18 09:38:54,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,102 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-02-18 09:38:54,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:54,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,133 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-02-18 09:38:54,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,167 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-02-18 09:38:54,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:54,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,198 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:54,199 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-02-18 09:38:54,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:54,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:54,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-02-18 09:38:54,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:54,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-18 09:38:54,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:54,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:54,302 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-02-18 09:38:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:54,680 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-02-18 09:38:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:54,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-18 09:38:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:54,681 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:38:54,681 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:38:54,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:38:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-18 09:38:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:38:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-18 09:38:54,799 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-18 09:38:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:54,800 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-18 09:38:54,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-18 09:38:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:38:54,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:54,800 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:54,801 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-02-18 09:38:54,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:38:54,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:54,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:54,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:54,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:54,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:54,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:54,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:54,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:54,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:54,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:54,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,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 18 treesize of output 24 [2019-02-18 09:38:54,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,986 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 20 treesize of output 34 [2019-02-18 09:38:54,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,993 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 22 treesize of output 45 [2019-02-18 09:38:54,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,053 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-02-18 09:38:55,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:55,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:55,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,110 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-02-18 09:38:55,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,142 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-02-18 09:38:55,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,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-02-18 09:38:55,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:55,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,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, 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 79 [2019-02-18 09:38:55,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,241 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-02-18 09:38:55,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:55,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,274 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 89 [2019-02-18 09:38:55,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:55,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:55,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:55,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-18 09:38:55,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:55,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:55,417 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-02-18 09:38:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:55,905 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-02-18 09:38:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:55,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:38:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:55,907 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:38:55,907 INFO L226 Difference]: Without dead ends: 32 [2019-02-18 09:38:55,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-18 09:38:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-02-18 09:38:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:38:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-02-18 09:38:55,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-02-18 09:38:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-02-18 09:38:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-02-18 09:38:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:38:55,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:55,996 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:55,996 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-02-18 09:38:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:55,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:55,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:38:56,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:56,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:38:56,117 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-02-18 09:38:56,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:56,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:56,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:56,120 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 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-02-18 09:38:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:56,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:56,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:56,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,150 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 20 treesize of output 34 [2019-02-18 09:38:56,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,158 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 22 treesize of output 45 [2019-02-18 09:38:56,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,204 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-02-18 09:38:56,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,231 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-02-18 09:38:56,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,259 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-02-18 09:38:56,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,292 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-02-18 09:38:56,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,323 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-02-18 09:38:56,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:56,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:56,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,413 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:56,414 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-02-18 09:38:56,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:56,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-18 09:38:56,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:56,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:56,524 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-02-18 09:38:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:56,897 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-02-18 09:38:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:56,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 09:38:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:56,899 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:38:56,899 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:38:56,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:38:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-02-18 09:38:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:38:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-02-18 09:38:57,018 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-02-18 09:38:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:57,018 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-02-18 09:38:57,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-02-18 09:38:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:38:57,018 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:57,018 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:57,019 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-02-18 09:38:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 09:38:57,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:57,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:57,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:57,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:57,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:57,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:57,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:57,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:57,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:57,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:57,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,258 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 20 treesize of output 34 [2019-02-18 09:38:57,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,267 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 22 treesize of output 45 [2019-02-18 09:38:57,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,345 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-02-18 09:38:57,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,390 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-02-18 09:38:57,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,424 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-02-18 09:38:57,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:57,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,482 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-02-18 09:38:57,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,511 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-02-18 09:38:57,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:57,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,549 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:57,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, 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-02-18 09:38:57,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,584 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-02-18 09:38:57,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:57,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,612 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 81 [2019-02-18 09:38:57,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:57,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:57,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:57,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:57,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:57,736 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-02-18 09:38:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:58,176 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-02-18 09:38:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:58,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 09:38:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:58,178 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:38:58,178 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:38:58,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:38:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:38:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-02-18 09:38:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:38:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-02-18 09:38:58,310 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-02-18 09:38:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:58,310 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-02-18 09:38:58,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-02-18 09:38:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:38:58,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:58,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:58,311 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-02-18 09:38:58,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:58,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:58,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:58,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:38:58,513 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-02-18 09:38:58,513 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:58,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:58,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:58,516 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:38:58,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:58,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:58,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 15 treesize of output 18 [2019-02-18 09:38:58,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,543 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 18 treesize of output 24 [2019-02-18 09:38:58,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:58,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,565 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 22 treesize of output 45 [2019-02-18 09:38:58,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:38:58,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:58,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,673 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-02-18 09:38:58,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:58,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,924 INFO L303 Elim1Store]: Index analysis took 228 ms [2019-02-18 09:38:58,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 09:38:58,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,956 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-02-18 09:38:58,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-18 09:38:58,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,052 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:59,053 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-02-18 09:38:59,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,092 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-02-18 09:38:59,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-18 09:38:59,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,128 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:59,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, 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-02-18 09:38:59,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:38:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:59,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:59,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:59,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:59,309 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-02-18 09:38:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:59,881 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-02-18 09:38:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:59,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:38:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:59,883 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:38:59,883 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:38:59,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:39:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-02-18 09:39:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:39:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-02-18 09:39:00,052 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-02-18 09:39:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:00,052 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-02-18 09:39:00,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-02-18 09:39:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:39:00,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:00,052 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:00,053 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-02-18 09:39:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:39:00,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:00,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:00,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:00,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:00,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:00,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:39:00,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:00,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:00,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:00,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,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 18 treesize of output 24 [2019-02-18 09:39:00,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,340 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 20 treesize of output 34 [2019-02-18 09:39:00,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,347 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 22 treesize of output 45 [2019-02-18 09:39:00,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-18 09:39:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,428 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-02-18 09:39:00,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,454 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-02-18 09:39:00,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-18 09:39:00,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,504 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:00,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-18 09:39:00,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,592 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-02-18 09:39:00,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-18 09:39:00,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,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 35 treesize of output 61 [2019-02-18 09:39:00,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,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-02-18 09:39:00,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-02-18 09:39:00,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,697 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 81 [2019-02-18 09:39:00,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,732 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-02-18 09:39:00,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-18 09:39:00,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,771 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 81 [2019-02-18 09:39:00,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-18 09:39:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:00,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-02-18 09:39:00,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:00,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:00,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:39:00,919 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-02-18 09:39:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:01,538 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-02-18 09:39:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:01,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-18 09:39:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:01,539 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:39:01,539 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:39:01,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-18 09:39:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:39:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:39:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:39:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:39:01,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-18 09:39:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:01,541 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:39:01,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:39:01,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:39:01,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:39:01,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:01,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:02,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:03,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:04,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:05,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:06,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:07,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:07,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:07,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:08,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:09,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:10,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:10,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:11,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:11,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:11,717 WARN L181 SmtUtils]: Spent 10.16 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-02-18 09:39:25,478 WARN L181 SmtUtils]: Spent 13.75 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-02-18 09:39:25,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:39:25,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-18 09:39:25,481 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-18 09:39:25,481 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-18 09:39:25,481 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-18 09:39:25,482 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-02-18 09:39:25,482 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:39:25,482 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-18 09:39:25,482 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-18 09:39:25,482 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-18 09:39:25,482 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-18 09:39:25,497 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:39:25 BoogieIcfgContainer [2019-02-18 09:39:25,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:39:25,498 INFO L168 Benchmark]: Toolchain (without parser) took 81892.04 ms. Allocated memory was 140.5 MB in the beginning and 845.7 MB in the end (delta: 705.2 MB). Free memory was 108.1 MB in the beginning and 127.3 MB in the end (delta: -19.3 MB). Peak memory consumption was 773.7 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:25,499 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:39:25,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.14 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:25,499 INFO L168 Benchmark]: Boogie Preprocessor took 33.63 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:25,499 INFO L168 Benchmark]: RCFGBuilder took 321.60 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 93.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:25,499 INFO L168 Benchmark]: TraceAbstraction took 81475.14 ms. Allocated memory was 140.5 MB in the beginning and 845.7 MB in the end (delta: 705.2 MB). Free memory was 93.8 MB in the beginning and 127.3 MB in the end (delta: -33.6 MB). Peak memory consumption was 759.4 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:25,501 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.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.14 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.63 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.60 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 93.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81475.14 ms. Allocated memory was 140.5 MB in the beginning and 845.7 MB in the end (delta: 705.2 MB). Free memory was 93.8 MB in the beginning and 127.3 MB in the end (delta: -33.6 MB). Peak memory consumption was 759.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 81.3s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 23.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...